Consensus Mechanism

Consensus Mechanism

BABE/GRANDPA with Temporal Proofs

ROKO Network extends Substrate's proven BABE/GRANDPA consensus with temporal proof requirements. Rather than replacing consensus, ROKO adds time beacon verification to block validity rules.


Overview

ROKO's approach:

  • BABE: Handles block production and slot assignment (standard Substrate)
  • GRANDPA: Provides finality (standard Substrate)
  • Time Beacons: Add temporal proof requirements to blocks

This modular design means:

  • Battle-tested consensus mechanisms remain unchanged
  • Temporal features layer on top via Substrate pallets
  • Other chains can adopt beacon technology independently

How It Works

Block Production with Temporal Proofs

When a validator is assigned a slot by BABE:

1. Collect transactions from mempool

2. Gather fresh beacons from local cache

3. Select K beacons for the proof (K-of-N selection)

4. Calculate median timestamp from selected beacons

5. Assemble block with beacon proof in header

6. Sign and broadcast block to network

Block Validation

Other validators verify:

1. Standard BABE validity checks

2. Each beacon signature in the proof

3. Beacons are within drift tolerance window

4. Block timestamp matches beacon median

5. Temporal ordering of transactions (if Type 3)


Temporal Proof Structure

Block Header
Parent Hash
    Block Number
    State Root
    Extrinsics Root

    ─── Beacon Proof ───────────────────────────────────────────────────────────

    Claimed Time:   T
    Spread:         max - min
    Median:         canonical time

    • Beacon 1: {validator, ts, sig}
    • Beacon 2: {validator, ts, sig}
    • Beacon 3: {validator, ts, sig}

    ─────────────────────────────────────────────────────────────────────────────

    BABE Seal (slot, authority, signature)

Validator Requirements

Hardware

ComponentMinimumPurpose
Time CardOCP TAP 2.0Hardware timestamp generation
GPS AntennaActive, 30dB gainTime source
NICPTP-capable (Intel X710/E810)Hardware timestamping
CPU8+ coresBlock production
RAM16 GB+Beacon cache

Time Synchronization

Validators must maintain synchronization within the network's drift tolerance:

Network PhaseDrift Tolerance
Launch2 seconds
Mature500ms target
# Check time sync status
    roko validator time-status

    # Example output:
    # Time Sync Status
    # ================
    # Local Time:     1730123456789000 μs
    # Network Median: 1730123456790000 μs
    # Drift:          +1ms ✓
    # Beacon Rate:    150ms
    # Cache Size:     47 beacons

Finality

GRANDPA provides finality as normal. Once a block is finalized:

  • Its beacon proof is immutable
  • Temporal ordering of transactions is locked
  • No reordering possible

Finality time: 2-3 seconds (inherited from GRANDPA configuration)


Fork Resolution

If forks occur, resolution uses:

1. GRANDPA votes (primary - standard Substrate)

2. Temporal precedence (tiebreaker - earlier median wins)

3. Stake weight (final tiebreaker)

Fork A: median timestamp 10:17:36.789
    Fork B: median timestamp 10:17:36.792

    → Fork A has temporal precedence (if GRANDPA votes equal)

Staking

Standard Substrate staking with temporal performance bonuses:

Rewards

Validators earn from:

1. Block production - Standard BABE rewards

2. Attestations - GRANDPA participation

3. Temporal accuracy - Bonus for maintaining sync

Slashing

Validators can be slashed for:

  • Double signing (standard)
  • Excessive drift - Beacons consistently outside tolerance
  • Beacon manipulation - Invalid signatures or timestamps

Pallet Architecture

ROKO's temporal features are implemented as modular Substrate pallets:

PalletDepends OnFunction
Beacons-Validator beacon production
Time BlocksBeaconsBeacon proofs in blocks
Temporal TransactionsBeacons, Time BlocksType 3 transactions
Frontier (forked)All aboveEVM with temporal ordering

This allows partial adoption:

  • Beacons only (cross-chain time source)
  • Beacons + Time Blocks (proven block timestamps)
  • Full stack (temporal ordering)

Current Limitations

Active research areas:

1. Gossip propagation - Honest block producers may miss transactions due to network delays

2. Beacon back-dating - Preventing stale beacon reuse in transaction proofs

3. Storage optimization - Reducing beacon proof overhead


See Also