Get the latest Chainlink content straight to your inbox. Subscribe.

Chainlink Labs Research

Research

VOLE-Based ZK

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.

Read more
A banner entitled ZK Blog Series #3: Commit-and-Prove ZKs
Research

Commit-and-Prove ZKs

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

Read more
A banner entitled ZK Blog Series #2: Background on Computation Complexity Metrics
Research

Background on Computation Complexity Metrics

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

Read more
A banner entitled ZK Blog Series #1: Introduction to Interactive Zero-Knowledge Proofs
Feature, Research

Introduction to Interactive Zero-Knowledge Proofs

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.

Read more
Banner titled The Latest View on View Synchronization
Research

The Latest View on View Synchronization

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

Read more
Research

Minority Corruption Resilience in Byzantine Generals With Unknown and Fluctuating Participation

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

Read more
Byzantine Generals with Unknown and Dynamic Participation
Research

Instant Finality in Byzantine Generals With Unknown and Dynamic Participation

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

Read more
  • Get the latest Chainlink content straight to your inbox