# Zero-knowledge proof Zero-knowledge proof is a cryptographic protocol in which a prover convinces a verifier that a statement is true without revealing information beyond its truth. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## We beat Google's zero-knowledge proof of quantum cryptanalysis DevFeed: [We beat Google's zero-knowledge proof of quantum cryptanalysis]() Original publisher: [Read original article]() Author: "Keegan Ryan" Published: 2026-04-17T11:00:00Z Content type: article Language: en Sources: [The Trail of Bits Blog](), [The Trail of Bits Blog]() Topics: [Zero-knowledge proof](), [Cryptography](), [Google](), [Vulnerabilities](), [Memory Safety](), [Rust](), [Code](), [Ethereum]() Tags: [code](), [cryptography](), [google](), [memory](), [memory-safety](), [quantum](), [rust](), [vulnerabilities](), [zero-knowledge]() ### AI overview Trail of Bits presents a zero-knowledge proof that improves on Google's reported resource bounds for quantum circuits. The article attributes the result to memory-safety and logic vulnerabilities in Google's Rust prover code, explains the zkVM-based proof setup, and describes the released proof-forging code. ### Source excerpt Two weeks ago, Google's Quantum AI group published a zero-knowledge proof of a quantum circuit so optimized, they concluded that first-generation quantum computers will break elliptic curve cryptography keys in as little as 9 minutes. Today, Trail of Bits is publishing our own zero-knowledge proof that significantly improves Google's on all metrics. Our result is not due to some quantum breakthrough, but rather the exploitation of multiple subtle memory safety and logic vulnerabilities in Google's Rust prover code. Google has patched their proof, and their scientific claims are unaffected, but this story reflects the unique attack surface that systems introduce when they use zero-knowledge proofs. Google's proof uses a zero-knowledge virtual machine (zkVM) to calculate the cost of a quantum circuit on three key metrics. The total number of operations and Toffoli gate count represent the running time of the circuit, and the number of qubits represents the memory requirements. Google, along with their coauthors from UC Berkeley, the Ethereum Foundation, and Stanford, published proofs for two circuits; one minimizes the number of gates, and the other minimizes qubits. Our proof improves on both. Resource Type Google's Low-Gate Google's Low-Qubit Our Proof Total Operations 17,000,000 17,000,000 8,300,000 Number of Qubits 1,425 1,175 1,164 Toffoli Count 2,100,000 2,700,000 0 Table 1: Resource upper bounds reported in different proofs for circuits computing the correct output across 9,024 randomly sampled inputs Our proof fully verifies when using Google's unpatched verification code. It has the same verification key as their original proofs and is cryptographically indistinguishable from a zero-knowledge proof resulting from actual algorithmic improvements to the quantum circuit. We are releasing the code we developed to forge the proof, and a summary of our proof follows. Circuit SHA-256 hash: 0x7efe1f62bb14a978322ab9ed41d670fc0fe0f211331032615c910df5a540e999 Groth16 pr ## Safeguarding cryptocurrency by disclosing quantum vulnerabilities responsibly DevFeed: [Safeguarding cryptocurrency by disclosing quantum vulnerabilities responsibly]() Original publisher: [Read original article]() Published: 2026-03-31T02:03:00Z Content type: article Language: en Sources: [The latest research from Google]() Topics: [Cryptocurrency](), [Vulnerabilities](), [Post-quantum cryptography](), [Quantum Computing](), [Cryptography](), [Zero-knowledge proof](), [Google]() Tags: [algorithms-theory](), [awareness](), [coinbase](), [cryptocurrency](), [cryptography](), [ethereum](), [google](), [government](), [migration](), [post-quantum](), [quantum](), [quantum-computing](), [research](), [security-privacy-and-abuse-prevention](), [vulnerabilities](), [zero-knowledge]() ### AI overview Google Research describes how future quantum computers could break the elliptic-curve cryptography protecting cryptocurrency with fewer resources than previously estimated. The article recommends transitioning blockchains to post-quantum cryptography and presents zero-knowledge proofs as a way to disclose vulnerabilities responsibly. ### Source excerpt Algorithms & Theory ## Ethereum Protocol Studies 2026 DevFeed: [Ethereum Protocol Studies 2026]() Original publisher: [Read original article]() Author: Josh Davis; Mario Havel Published: 2026-02-17T00:00:00Z Content type: release Language: en Sources: [Ethereum Foundation Blog]() Topics: [Ethereum](), [Cryptography](), [Learning](), [Zero-knowledge proof](), [Post-Quantum](), [foss](), [Discord](), [Wiki]() Tags: [2026](), [cryptography](), [discord](), [ethereum](), [foss](), [learning](), [math](), [platform](), [post-quantum](), [q-a](), [real-time](), [research-development](), [video](), [zero-knowledge]() ### AI overview Ethereum Protocol Studies returns in 2026 with new cryptography and consensus content tracks, including material on zkEVMs, plus a self-paced learning platform built on Moodle. The program begins February 23. ### Source excerpt tl;dr: Ethereum Protocol Studies returns for 2026 with new content tracks in cryptography, lean consensus and zkEVM, plus a new self-paced learning platform. The program kicks off February 23rd. Visit epf.wiki to get started. Ethereum Protocol Studies (EPS) is back. Since launching as a 10-week study group ahead of... ## Accelerating zk-SNARKs - MSM and NTT algorithms on FPGAs with Hardcaml DevFeed: [Accelerating zk-SNARKs - MSM and NTT algorithms on FPGAs with Hardcaml]() Original publisher: [Read original article]() Author: Andrew Ray Published: 2022-12-07T00:00:00Z Content type: article Language: en Sources: [Jane Street]() Topics: [Zero-knowledge proof](), [Cryptography](), [fpga](), [Algorithms, Complexity](), [Open Source]() Tags: [algorithms](), [blockchain](), [cryptography](), [fpga](), [open-source](), [web3](), [zero-knowledge]() ### AI overview This article describes Jane Street's ZPrize submissions for accelerating zk-SNARK proof construction with FPGA designs built using the open-source Hardcaml libraries. Its MSM solution on the BLS12-377 curve won first place in the MSM track, while its NTT solution took second place in the NTT track. ### Source excerpt In 2022 a consortium of companies ran an international competition, called the ZPrize, to advance the state of the art in "zero-knowledge" cryptography. We decided to have a go in our free time at submitting solutions to both the Multi-Scalar Multiplication (MSM) and Number Theoretic Transform (NTT) tracks, using the same open source Hardcaml libraries that Jane Street uses for our own FPGA development. We believe by using Hardcaml we were able to more efficiently and robustly come up with designs in the short competition period. These designs also interact with the standard vendor RTL flow and so we hope they will be useful to others. ## EF-Supported Teams: Research & Development Update DevFeed: [EF-Supported Teams: Research & Development Update]() Original publisher: [Read original article]() Author: Ethereum Foundation Published: 2020-12-09T00:00:00Z Content type: article Language: en Sources: [Ethereum Foundation Blog]() Topics: [Ethereum](), [zero-knowledge](), [Zero-knowledge proof](), [Application Development]() Tags: [application-development](), [audit](), [contribution](), [development](), [ethereum](), [organizational](), [privacy](), [research](), [research-development](), [teams](), [update]() ### AI overview This Ethereum Foundation update reviews progress from EF-supported teams, including research and development related to Ethereum. It highlights the Applied ZKP team's Perpetual Powers of Tau ceremony, its participation and verification model, and related work on Semaphore and other Ethereum projects. ### Source excerpt Friends, Leaves have fallen for those in the global north, Summer is on the way in the south, and ETH is staked across the globe. The jolliest of holidays has arrived, the birth of the beacon chain. Moreover, incredible progress has been made in recent months by all EF... ## EF-Supported Teams: Research & Development Update DevFeed: [EF-Supported Teams: Research & Development Update]() Original publisher: [Read original article]() Author: Ethereum Foundation Published: 2020-04-14T00:00:00Z Content type: news Language: en Sources: [Ethereum Foundation Blog]() Topics: [Blockchain](), [Development](), [releases](), [C++](), [Remote Procedure Call (RPC)](), [Testing](), [Zero-knowledge proof](), [Optimization](), [pass]() Tags: [also](), [c-plus-plus](), [community](), [development](), [ethereum](), [network](), [optimization](), [organizational](), [research-development](), [rpc](), [testing](), [zero-knowledge]() ### AI overview The Ethereum Foundation's update reports progress from EF-supported research and development teams. It highlights Aleth 1.8.0, including improvements to its RPC interface, blockchain synchronization, network protocol, testing tools, and consensus-related features, while noting that Aleth will receive only basic maintenance going forward. The article also discusses zero-knowledge proof application development on Ethereum. ### Source excerpt Friends, From our team to you and yours, we hope everyone and their families are well and keeping safe during these complicated weeks. To help pass some time while we're all stuck in doors, it's time again to update the community on progress made by some of the EF-supported... ## Zero-Knowledge: Definitions and Theory DevFeed: [Zero-Knowledge: Definitions and Theory]() Original publisher: [Read original article]() Published: 2016-09-19T09:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Zero-knowledge proof](), [Graphs](), [Protocol (disambiguation)](), [class]() Tags: [graph-isomorphism](), [np](), [permutation](), [protocol](), [theory](), [zero-knowledge]() ### AI overview This article explains definitions and theory behind zero-knowledge proofs. It contrasts graph isomorphism and 3-coloring protocols, focusing on their interaction between prover and verifier, cryptographic assumptions, transcript distributions, and simulation. ### Source excerpt The next Monday, when the fathers were all back at work, we kids were playing in a field. One kid says to me, "See that bird? What kind of bird is that?" I said, "I haven't the slightest idea what kind of a bird it is." He says, "It's a brown-throated thrush. Your father doesn't teach you anything!" But it was the opposite. He had already taught me: "See that bird? ## Zero Knowledge Proofs for NP DevFeed: [Zero Knowledge Proofs for NP]() Original publisher: [Read original article]() Published: 2016-08-01T08:00:53Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Zero-knowledge proof](), [zero-knowledge](), [Cryptography](), [Algorithms](), [Code]() Tags: [algorithm](), [boolean](), [circuit](), [computational-complexity](), [cryptography](), [graph-isomorphism](), [interactive](), [mathematics](), [np](), [np-hard](), [one-way-functions](), [programming](), [python](), [random-number-generators](), [variables](), [zero-knowledge]() ### AI overview This tutorial explains how zero-knowledge proofs extend beyond graph isomorphism to problems in NP, using cryptography to let a prover convince a verifier without revealing the secret knowledge behind the claim. It introduces examples including boolean formulas, subset sums, graph 3-coloring, and boolean circuits, and describes an implementation of a proof for graph 3-colorability. ### Source excerpt Last time, we saw a specific zero-knowledge proof for graph isomorphism. This introduced us to the concept of an interactive proof, where you have a prover and a verifier sending messages back and forth, and the prover is trying to prove a specific claim to the verifier. A zero-knowledge proof is a special kind of interactive proof in which the prover has some secret piece of knowledge that makes it very easy to verify a disputed claim is true. ## Zero Knowledge Proofs -- A Primer DevFeed: [Zero Knowledge Proofs -- A Primer]() Original publisher: [Read original article]() Published: 2016-07-05T08:00:29Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Zero-knowledge proof](), [zero-knowledge](), [Graphs](), [Algorithm]() Tags: [algorithm](), [complexity-theory](), [cryptography](), [graph](), [graph-isomorphism](), [mathematics](), [programming](), [python](), [simulator](), [zero-knowledge]() ### AI overview This primer explains zero-knowledge proofs through the graph isomorphism problem. It introduces the roles of the prover, verifier, and simulator, and describes graph isomorphism using vertex-label permutations. ### Source excerpt In this post we'll get a strong taste for zero knowledge proofs by exploring the graph isomorphism problem in detail. In the next post, we'll see how this relates to cryptography and the bigger picture. The goal of this post is to get a strong understanding of the terms "prover," "verifier," and "simulator," and "zero knowledge" in the context of a specific zero-knowledge proof. Then next time we'll see how the same concepts (though not the same proof) generalizes to a cryptographically interesting setting.