How Chainlink DECO could help support crypto self-custody and key recovery in a privacy-preserving way.

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 exploration into proof-of-solvency systems that use decentralized oracle networks to enable transparent, trust-minimized reporting.

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.

This post explains approaches for building Blind Order-Fairness on DAG-based BFT consensus to prevent maximal extractable value (MEV) exploits.

Dive into key research updates about CCIP, DECO, FSS, and OCR 2.0 from SmartCon 2022.