Millisecond Finality
No block delay. No mempool. Transactions confirm in milliseconds, not minutes. CPoS is limited only by the speed of light.
The world's fastest truly decentralised consensus algorithm for a global state machine. CPoS operates as a CRDT, not a blockchain, solving the scalability trilemma.
Consensus through convergence, not competition
Each peer maintains a Belief—a data structure representing its view of consensus across the whole network, including the latest block orderings from other peers. Beliefs are shared through random gossip between peers, requiring only occasional communication to keep the system in sync.
When a peer receives beliefs from others, it applies the Belief Merge Function—a mathematical operation that combines beliefs into an updated view. This function is idempotent, commutative, and associative, forming a join-semilattice that satisfies the conditions of a Conflict-free Replicated Data Type (CRDT). Repeated applications automatically converge to a stable consensus.
Conflicts in proposed block orderings are resolved by stake-weighted voting. Peers compute total stake voting for each proposed block at each position. Peers supporting minority orderings are excluded from subsequent votes, creating a strong incentive to align with the majority. This procedure provably converges to a single ordering.
Once 2/3 of peers align on the same ordering, a Proposed Consensus Point is established. When 2/3 of peers confirm this proposal, consensus is finalised. From this point, the ordering is immutable. Digital signatures ensure no peer can impersonate another—full cryptographic security is maintained throughout.
A fundamentally different architecture
What CPoS delivers
No block delay. No mempool. Transactions confirm in milliseconds, not minutes. CPoS is limited only by the speed of light.
Any peer may propose a block at any time. No leader election, no sequential bottleneck, no single point of failure. Blocks are proposed concurrently.
Consensus is guaranteed and stable as long as at least 2/3 of voting power follows the protocol honestly. Proven secure against even powerful adversaries.
Users submit transactions to a trusted peer—not broadcast to a public mempool. No opportunity for miners or validators to reorder transactions for profit.
No Proof of Work. No energy-intensive mining. CPoS achieves superior security using a fraction of the power—ecologically defensible by design.
Every transaction executes fully or rolls back completely. Turing-complete logic with automatic failure protection eliminates partial failures.
Proven stability under adversarial conditions
If more than 50% of peers adopt the same ordering and are mutually aware of each other's agreement, the ordering is provably stable—no matter what adversaries attempt.
With at least 2/3 of peers aligned and fewer than 1/3 being adversarial, consensus is provably stable against irrelevant alternatives and colluding attackers.
With 75% alignment, consensus holds even against adversaries capable of temporarily isolating peers, censoring messages, or delaying activity of honest participants.
Explore the full Convex technology stack or start building on the network today.