Consensus

The consensus mechanism for verified compute coordination

Experimental Feature

This feature is experimental and may change significantly in future versions.

Consensus Overview

ComputeNet uses a hybrid consensus mechanism that combines BFT-style agreement for receipt ordering with probabilistic finality for high throughput. This allows the network to process many compute jobs while maintaining strong consistency guarantees.

Consensus Phases

  1. 1
    Proposal

    Leader proposes a batch of compute receipts for inclusion

  2. 2
    Verification

    Validators verify all receipts in the proposed batch

  3. 3
    Pre-commit

    Validators signal intent to commit if verification passes

  4. 4
    Commit

    With quorum achieved, batch is finalized and receipts are anchored

Quorum Requirements

// Quorum calculation
const VALIDATOR_COUNT = activeValidators.length;
const QUORUM = Math.ceil((2 * VALIDATOR_COUNT) / 3) + 1;

// Example: 100 validators
// Quorum = ceil(200/3) + 1 = 68 validators required

// For a batch to be committed:
// - At least QUORUM validators must verify and sign
// - No conflicting receipts in the batch
// - All receipts pass cryptographic verification

Finality

Probabilistic Finality

Receipts are considered finalized after inclusion in a committed batch. Probability of reversal decreases exponentially with subsequent batches.

Absolute Finality

After a configurable number of confirmations, receipts achieve absolute finality and cannot be reversed under any circumstances.