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.

An evolution of “Pacemaker” solutions to the Byzantine View Synchronization problem finally led to optimal communication-complexity solutions.

Byzantine Generals with Unknown/Fluctuating Participation extended to tolerate to Minority Corruption.

A simple solution for the Byzantine generals problem with instant finality when there is an unknown and dynamic set of active nodes.

Abstract: Threshold signatures offer a concise, cheap way to verify consensus over very large groups, and we plan to use them to scale Chainlink’s security independently of Ethereum’s throughput. In this post I (1) review how threshold signatures work, following Stinson & Strobl’s 2001 paper; (2) describe a new Schnorr-like signature