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.

Andrew Lewis-Pye, Dahlia Malkhi, and Oded Naor expand the discussion of view synchronization and present a new protocol that quickly recovers in the case of a Byzantine leader.

Discover how the prover convinces the verifier that a TLS response is obtained from a particular server in Chainlink DECO.

Introducing a blog series outlining the research taking DECO, a privacy-preserving oracle protocol, from idea to implementation.

Understand an efficient protocol to generate VOLE correlations for batches of commitments.

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.

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.

This post introduces commit-and-prove zero-knowledge proofs (ZKPs), which can be used to recycle memory as the ZK protocol proceeds.

In this blog, we will discuss various aspects and metrics of circuits. This will help us understand how to design a scalable ZK system.

An intro to interactive zero-knowledge proofs. This is the first post in a series of ZK-related blogs by the Chainlink Labs Research team.