From a mechanism standpoint, Conflux doesn’t merely speed up block generation—it fundamentally optimizes performance by reimagining how blocks are organized and ordered. Its core innovation is the integration of a DAG (Directed Acyclic Graph) structure into blockchain, enabling all concurrently generated blocks to be effectively utilized instead of discarded as in traditional chains, which significantly boosts resource utilization.
In practice, this design delivers not only higher TPS and faster confirmations, but also strikes a careful balance between security and decentralization. Leveraging a hybrid PoW and PoS mechanism, Conflux preserves the security model of traditional blockchains while achieving performance levels suitable for large-scale applications, positioning it as a leading exploration in next-generation high-performance blockchain infrastructure.
Conflux (CFX)’s high performance is driven by its distinctive hybrid consensus model, which combines a dual-layer architecture of PoW (Proof of Work) + PoS (Proof of Stake). At the base layer, PoW handles block generation and network security; at the upper layer, PoS provides finality, reducing the risks of forks and 51% attacks. This approach allows Conflux to deliver security comparable to Bitcoin, while matching the throughput of modern high-performance public chains.
Crucially, Conflux introduces the Tree-Graph ledger structure, leveraging the GHAST algorithm for block ordering. Unlike serial blockchains like Ethereum, Conflux enables multiple blocks to be generated in parallel and incorporated into the system, dramatically increasing throughput. Official figures show this design achieves thousands of TPS and brings confirmation times down to under a few minutes.
Conflux also features a “dual-space architecture” (Core Space + eSpace). Core Space is responsible for native high-performance execution, while eSpace is fully EVM-compatible, allowing developers to migrate applications seamlessly. This further enhances network scalability and real-world usability.
Tree-Graph is the heart of Conflux’s innovation—a hybrid model that fuses the traditional blockchain structure with DAG (Directed Acyclic Graph). Traditional blockchains grow linearly, but DAG structures allow blocks to exist in parallel. Tree-Graph combines the strengths of both.
In Tree-Graph, each block has at least one “parent edge,” creating a tree-like main structure. Simultaneously, “reference edges” connect to multiple historical blocks, forming a complex DAG network. This means that even when multiple miners produce blocks at the same time, none are discarded—they’re all recorded and included in subsequent ordering.
The key advantage here is: Hash power is never wasted. In legacy chains, forked blocks are typically discarded; in Conflux, they remain valid, greatly improving resource utilization. This is a core reason why Conflux can achieve such high throughput.
On the transaction layer, Conflux employs a “parallel block generation + unified ordering” mechanism. When users submit transactions, they enter the node’s transaction pool, where miners select and package them into new blocks. Unlike traditional chains, multiple miners can generate blocks simultaneously, propagating them in parallel across the network.
Once incorporated into the Tree-Graph, these blocks don’t immediately form a single chain—they collectively create a DAG structure. The system then uses a consensus algorithm to order all blocks and finalize transaction sequencing. This approach eliminates the massive resource waste of “competitive block generation.”
For confirmations, Conflux uses the pivot chain + epoch model:
The pivot chain serves as the primary ordering reference
Blocks in the DAG are grouped into different epochs
Transactions within each epoch are sorted and confirmed
This design means confirmations no longer depend on the extension of a single chain, but are determined by the overall structure—significantly reducing latency and increasing throughput.
To achieve global consistency in a complex DAG, Conflux employs an algorithm inspired by GHOST (Greedy Heaviest Observed SubTree)—the GHAST (Greedy Heaviest Adaptive SubTree) algorithm.
This mechanism assigns a weight to each block and uses the network’s topology to compute the “heaviest chain” (pivot chain). This isn’t always the longest chain, but rather the chain with the highest cumulative weight and greatest stability.
With this, the system can:
Determine the global order of blocks
Convert the DAG into an executable linear sequence
Ensure all nodes ultimately reach consensus
This method overcomes the limitations of the longest chain rule, allowing the network to remain deterministic and consistent even under high block concurrency—key to Conflux’s speed and stability.
Conflux’s security design combines the strengths of PoW and PoS. The PoW layer provides robust defense, forcing attackers to expend significant hash power; the PoS layer delivers finality, preventing long forks or chain reorganizations.
The Tree-Graph structure itself also enhances security:
Forked blocks aren’t discarded, reducing the opportunity for attackers to profit from forks
Parallel block incorporation increases the complexity of attacks
The GHAST algorithm’s weighting mechanism mitigates the impact of malicious chains
Conflux further addresses the “winner-takes-all” issue in traditional PoW systems through its incentive model. Miners whose blocks don’t make the main chain still earn partial rewards, reducing the incentive for selfish mining and enhancing network stability.
Tree-Graph delivers major performance gains for blockchains:
First, throughput is substantially increased via parallel block generation and higher TPS; second, resource utilization is maximized, as nearly all blocks are used; third, confirmations are much faster—ideal for real-world applications.
Conflux’s EVM compatibility and dual-space design also mean it offers strong performance alongside excellent developer ecosystem adaptability.
However, this architecture introduces complexity:
The DAG structure and ordering mechanism are more intricate, placing greater demands on node computation and network synchronization. System implementation and maintenance costs are also higher. Under extreme network conditions, the complex topology can increase uncertainty in consensus latency.
In summary, Tree-Graph is a “complexity-for-performance” tradeoff—offering clear advantages for large-scale use cases, but requiring mature engineering and ecosystem support.
By introducing the Tree-Graph structure and GHAST consensus algorithm, Conflux (CFX) breaks the serial processing bottleneck of traditional blockchains, achieving a balance of high throughput, low latency, and strong security. Its hybrid PoW + PoS mechanism further strengthens network stability, optimizing the balance between performance and security.
This architecture not only elevates blockchain’s fundamental performance, but also provides reliable infrastructure for DeFi, NFT, and cross-chain applications. As Web3 demand grows, high-performance public chains like Conflux are poised to become key contenders in the next wave of infrastructure competition.
Because it utilizes the Tree-Graph structure, supporting parallel block generation and processing instead of single-chain serial execution, which dramatically increases throughput.
Tree-Graph is an enhanced form of DAG, introducing a main chain (pivot chain) ordering mechanism on top of DAG, enabling both parallelism and global consistency.
By using PoW for hash power security, PoS for finality, and combining the GHAST algorithm with incentive mechanisms to reduce risks from attacks and forks.
Yes, Conflux’s eSpace is fully EVM-compatible, enabling low-cost migration for Ethereum ecosystem applications.
Mainly higher system complexity, greater demands on node performance and network synchronization, and increased implementation and maintenance costs.





