Core properties
| Property | Value |
|---|---|
| Algorithm | WBFT (evolved from QBFT) |
| Fault tolerance | Up to f = ⌊(n−1)/3⌋ Byzantine validators |
| Finality | Deterministic — once committed, a block is irreversible |
| Block time | 1 second (configurable) |
| Epoch length | 10 blocks (default) |
| Signature scheme | BLS12-381 (aggregated) |
| Quorum | 2f + 1 signatures per phase |
| Proposer selection | Round-robin (default, configurable) |
How WBFT works
Every block goes through a two-phase commit protocol. Validators exchange signed messages in PREPARE and COMMIT phases, using BLS aggregated signatures for efficiency.Propose
The round-robin proposer assembles a candidate block and broadcasts it to the validator set.
PREPARE
Each validator verifies the block and broadcasts a PREPARE-VOTE. Once
2f + 1 votes are collected, the block is considered “prepared.”COMMIT
Validators broadcast a COMMIT-VOTE for the prepared block. When
2f + 1 COMMIT-VOTEs are collected and their BLS signatures are aggregated, the block is sealed and written to the chain.Validator set
Validators are managed on-chain through theGovValidator system contract — not through token staking.
- Permissioned — validator membership is governed by on-chain votes, not economic stake
- No block rewards — there is no inflationary issuance; validators earn only transaction fees distributed based on diligence metrics
- Epoch-based rotation — the active set is stable within each epoch (
10blocks by default) and updated only at epoch boundaries - Epoch transition — at each epoch block, the consensus engine reads the latest validator list from
GovValidatorand activates it for the next epoch
Performance
| Metric | Value |
|---|---|
| Block time | ~1 second |
| Finality | Immediate (same block) |
| Confirmation wait | 0 blocks |
Security guarantees
- Safety — no conflicting blocks can be finalized as long as fewer than
⌊(n−1)/3⌋validators are Byzantine - Liveness — the protocol requires a supermajority of validators online to continue producing blocks
- No reorgs — committed blocks are never reversed; there is no longest-chain fork-choice rule
- Permissioned validator set — governance-controlled membership limits the attack surface compared to open, stake-based networks
Developer implications
- No confirmation polling — treat a transaction as final the moment it appears in a block. You do not need to wait for N confirmations or track confirmation depth.
- No reorg handling — committed blocks are never reversed. You do not need rollback logic or reorganization detection in your contracts, indexers, or backend services.
- Predictable block time —
1-second blocks give your application a consistent settlement SLA. Time-sensitive workflows (payments, order matching) can rely on this cadence. - Full EVM compatibility — finality guarantees apply to all standard Ethereum transaction types. No chain-specific contract changes are required.
- Epoch-aware integrations — if your application monitors the validator set, note that changes take effect only at epoch boundaries (every
10blocks by default).
Next steps
System Overview
How the consensus layer and execution layer fit together.
1-Second Finality
Deterministic finality and what it means for your application.

