Commit-and-Prove ZKs | Chainlink Blog
This post introduces commit-and-prove zero-knowledge proofs (ZKPs), which can be used to recycle memory as the ZK protocol proceeds.| Chainlink Blog
This post introduces commit-and-prove zero-knowledge proofs (ZKPs), which can be used to recycle memory as the ZK protocol proceeds.| Chainlink Blog
Discover a commit-and-prove ZK proof system that can process tens of millions of gates per second and handle large circuits while requiring minimal memory.| Chainlink Blog
This post describes the transition from VOLE to commitment in VOLE-based ZK protocols and outlines how to generate VOLE correlations in a higher degree.| Chainlink Blog
Understand an efficient protocol to generate VOLE correlations for batches of commitments.| Chainlink Blog
We describe an efficient single-point VOLE (SPVOLE) protocol where the prover’s message is an all-zero vector except at one location.| Chainlink Blog
Dive into key research updates about CCIP, DECO, FSS, and OCR 2.0 from SmartCon 2022.| Chainlink Blog
In this post, the Chainlink Labs Research team discusses how to hide the individual lengths of sensitive data from the verifier.| Chainlink Blog
This post discusses how to efficiently parse the TLS response and form claims about it while preserving the privacy of sensitive data within the response.| Chainlink Blog
Discover how the prover convinces the verifier that a TLS response is obtained from a particular server in Chainlink DECO.| Chainlink Blog
Introducing a blog series outlining the research taking DECO, a privacy-preserving oracle protocol, from idea to implementation.| Chainlink Blog
