From a mechanism perspective, Conflux does not simply increase the block production speed. Instead, it optimizes performance by redesigning how blocks are organized and ordered. At its core, Conflux introduces a DAG (directed acyclic graph) structure into the blockchain, allowing all concurrently generated blocks to be used effectively rather than discarded as they often are in traditional chains. This significantly improves resource utilization.
In actual operation, this design not only delivers higher TPS and faster confirmation speeds, but also strikes a balance between security and decentralization. By combining PoW and PoS in a hybrid mechanism, Conflux maintains a security model similar to that of traditional blockchains while achieving performance better suited to large-scale applications. This makes it an important direction of exploration for next-generation high-performance blockchain infrastructure.
Conflux’s (CFX) high performance comes from its distinctive hybrid consensus design, a two-layer structure that combines PoW (Proof of Work) + PoS (Proof of Stake). At the base layer, PoW is responsible for block generation and network security. At the upper layer, PoS provides finality, reducing the risks of forks and 51% attacks. This design gives Conflux security closer to Bitcoin while also providing processing capacity comparable to modern high-performance public chains.
More importantly, Conflux introduces the Tree-Graph ledger structure, which works with the GHAST algorithm to order blocks. Unlike sequential blockchains such as Ethereum, Conflux allows multiple blocks to be generated in parallel and included in the system, greatly improving throughput. According to official data, this mechanism can achieve thousands of TPS and reduce confirmation time to within minutes.
Conflux also uses a dual-space architecture, made up of Core Space and eSpace. Core Space handles native high-performance execution, while eSpace is fully compatible with the Ethereum Virtual Machine and allows developers to migrate applications seamlessly. This structure further strengthens the network’s scalability and practical usability.
Tree-Graph is Conflux’s core innovation. In essence, it is a hybrid model that combines a traditional blockchain structure with a DAG (directed acyclic graph). Traditional blockchains can only grow linearly, while a DAG structure allows multiple blocks to exist in parallel. Tree-Graph brings together the advantages of both.
In Tree-Graph, each block has at least one parent edge, forming a main structure similar to a tree. At the same time, it can connect to multiple historical blocks through reference edges, forming a more complex DAG network. This means that even when multiple miners produce blocks at the same time, those blocks are not discarded. Instead, they are all recorded and included in later ordering.
The key significance of this structure is that hash power is no longer wasted. In traditional chains, forked blocks are usually discarded. In Conflux, these blocks remain valid, greatly improving resource utilization. This is one of the core reasons Conflux can achieve high throughput.
At the transaction processing level, Conflux uses a mechanism of parallel block production plus unified ordering. After a user submits a transaction, it enters the node’s transaction pool, where miners select it and package it into a new block. Unlike traditional chains, multiple miners can generate blocks at the same time, and these blocks propagate through the network in parallel.
After these blocks are added to the Tree-Graph, they do not immediately form a single chain. Instead, they collectively make up a DAG structure. The system then uses a consensus algorithm to order all blocks and ultimately determine the transaction sequence. This process avoids the large amount of resource waste caused by competitive block production.
For confirmation, Conflux uses the pivot chain + epoch model:
The pivot chain serves as the main ordering reference
Blocks in the DAG are divided into different epochs
Transaction ordering and confirmation are completed within each epoch
With this design, transaction confirmation no longer depends on the extension of a single chain. Instead, it is completed based on the overall structure, significantly reducing latency and improving throughput.
To achieve network-wide consistency within a complex DAG structure, Conflux introduces GHAST (Greedy Heaviest Adaptive SubTree), an improved algorithm inspired by GHOST (Greedy Heaviest Observed SubTree).
The core logic of this mechanism is to assign weight to each block and calculate the pivot chain, or the “heaviest chain,” based on the topology of the entire network. This chain is not necessarily the longest chain. Rather, it is the chain with the highest accumulated weight and greatest stability.
On this basis, the system can:
Determine the global order of blocks
Convert the DAG into an executable linear order
Ensure that all nodes eventually reach consensus
This mechanism avoids the limitations of the traditional longest-chain rule. It allows the system to maintain determinism and consistency even when blocks are produced with high concurrency, which is the key to Conflux being both fast and stable.
In its security design, Conflux combines the strengths of PoW and PoS. The PoW layer provides attack resistance by ensuring that attackers must pay a high computational cost. The PoS layer provides finality, helping prevent long forks or reorganization attacks.
The Tree-Graph structure itself also strengthens security:
Forked blocks are not discarded, reducing the room for attackers to profit from forks
Multiple blocks are included in the system in parallel, increasing attack complexity
The GHAST algorithm uses a weighting mechanism to reduce the influence of malicious chains
Conflux also uses incentive mechanism design to avoid the winner-takes-all problem seen in traditional PoW systems. Even if a block generated by a miner is not on the main chain, it can still receive partial rewards. This reduces the incentive for selfish mining and improves network stability.
In terms of advantages, the Tree-Graph structure significantly improves blockchain performance.
First, it increases throughput by enabling higher TPS through parallel block production. Second, it improves resource utilization, as nearly all blocks can be used. At the same time, it delivers faster confirmation speeds, making it better suited to real-world application scenarios.
In addition, Conflux’s EVM compatibility and dual-space design mean it is not only strong in performance, but also well adapted to developer ecosystems.
However, this design also introduces a certain level of complexity.
On one hand, the DAG structure and ordering mechanism are more complex, placing higher demands on node computation and network synchronization. On the other hand, system implementation and maintenance costs are also relatively higher. In extreme network conditions, the complex topology may also increase uncertainty around consensus latency.
Overall, Tree-Graph is a design that trades complexity for performance. It offers clear advantages in large-scale application scenarios, but it also requires more mature engineering implementation and stronger ecosystem support.
By introducing the Tree-Graph structure and GHAST consensus algorithm, Conflux (CFX) breaks through the performance limits of traditional blockchain serial processing and achieves a balance among high throughput, low latency, and strong security. At the same time, its hybrid PoW + PoS mechanism further strengthens network stability, helping it find a better balance between performance and security.
This design not only improves the basic performance of blockchain systems, but also provides more reliable underlying support for DeFi, NFTs, and cross-chain applications. As demand for Web3 applications continues to grow, high-performance public chains such as Conflux may become an important direction in the next stage of infrastructure competition.
Because it uses a Tree-Graph structure that supports multiple blocks being generated and processed in parallel, rather than executing everything sequentially on a single chain. This greatly improves throughput.
Tree-Graph is an improved form of DAG. It introduces a pivot chain ordering mechanism on top of the DAG structure, giving it both parallel processing capability and global consistency.
It uses PoW to provide hash-power-based security and PoS to provide finality. It also combines the GHAST algorithm with incentive mechanisms to reduce attack and fork risks.
Yes. Conflux’s eSpace is fully compatible with EVM, allowing Ethereum ecosystem applications to migrate at low cost.
Its main drawbacks are higher system complexity, greater requirements for node performance and network synchronization, and higher implementation and maintenance costs.





