ZC-1 DAG Consensus Algorithm Guide

📋 Algorithm Overview

ZC-1 implements a cutting-edge Byzantine Fault Tolerant (BFT) consensus algorithm designed for high-throughput, quantum-resistant blockchain networks. Our consensus mechanism combines the security of traditional BFT protocols with modern cryptographic innovations.

105,000+

Transactions Per Second

< 2s

Block Finality

33%

Byzantine Fault Tolerance

∞

Quantum Resistance

🔄 Consensus Flow

The ZC-1 consensus process follows a multi-phase approach ensuring both safety and liveness properties:

1 Proposer Selection (VRF): A validator is cryptographically selected using Verifiable Random Functions, ensuring fairness and preventing manipulation.

2 Block Proposal: The selected proposer broadcasts a new block containing transactions, data blobs, and zK-SNARK proofs.

3 Prevote Phase: Validators examine the proposed block and broadcast prevote messages if the block is valid.

4 Precommit Phase: Upon receiving 2/3+ prevotes, validators broadcast precommit messages confirming their commitment.

5 Block Commit: With 2/3+ precommits, the block is finalized and added to the blockchain permanently.

🎲 VRF Proposer Selection

ZC-1 uses Verifiable Random Functions (VRF) to ensure fair and unpredictable proposer selection while maintaining cryptographic verifiability.

function selectProposer(height, validators) {
    const seed = combineHashes(height, previousBlockHash, timestamp);
    const vrf_output = VRF.compute(seed, validator_private_key);
    
    // Stake-weighted selection
    const threshold = calculateThreshold(validator.stake, total_stake);
    
    if (vrf_output.value < threshold) {
        return validator.id;  // This validator is selected
    }
    
    return selectNext(validators, vrf_output);
}
                

🔒 Cryptographic Security

VRF ensures that proposer selection cannot be manipulated or predicted in advance, preventing various attack vectors.

⚖️ Stake Weighting

Selection probability is proportional to validator stake, incentivising participation while maintaining decentralisation.

🔍 Verifiable Process

Anyone can cryptographically verify that the correct proposer was selected for each block height.

🛡️ Safety & Liveness Guarantees

ZC-1's consensus algorithm provides strong safety and liveness guarantees under Byzantine conditions:

🔐 Safety

No Forks: With honest majority (≥2/3), conflicting blocks cannot be finalized simultaneously.

Finality: Once committed, blocks are permanent and irreversible.

⚡ Liveness

Progress Guarantee: New blocks are continuously produced as long as ≥2/3 validators are online and honest.

Timeout Mechanism: View changes ensure progress even with faulty proposers.

⚙️ Implementation Details

Technical specifications and optimisations in ZC-1's consensus implementation:

📡 Network Layer

Optimized P2P gossip protocol with message deduplication and efficient routing for sub-second block propagation.

💾 State Management

Incremental state transitions with Merkle proof verification, supporting high-speed transaction processing.

🔄 View Changes

Adaptive timeout mechanisms and leader rotation ensure continuous block production under network partitions.

📊 Performance Metrics

Real-time monitoring of consensus health, validator participation, and network synchronisation status.

🔗 ZC-1 DAG Consensus Algorithm Guide