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.