The Problem With Linear Blockchains
In Bitcoin and most other proof-of-work networks, there is exactly one canonical chain. Miners around the world race to solve the same puzzle, and whoever wins appends their block to the tip of that chain. Everyone else's work — any blocks mined at roughly the same time — gets discarded. These discarded blocks are called orphan blocks, and they represent a fundamental inefficiency built into the linear blockchain model.
Orphan blocks mean wasted hash power. They also create a tension at the heart of the blockchain trilemma: if you increase the block rate to speed up confirmations, more blocks arrive in parallel, more get orphaned, and the chain becomes less secure. If you slow the block rate down to reduce orphans, the network becomes sluggish. Bitcoin's ten-minute block interval is not an arbitrary choice — it is a careful calibration to keep the orphan rate low enough to maintain security.
Kaspa's engineers asked a different question: what if you did not throw those competing blocks away?
What Is a Directed Acyclic Graph (DAG)?
A directed acyclic graph, or DAG, is a data structure where nodes have directional connections and there are no cycles — you can never follow the arrows and arrive back where you started. In the context of a cryptocurrency, each block is a node, and the arrows represent "parent" references. A standard blockchain is a trivially simple DAG: every block has exactly one parent, forming a single line.
A blockDAG is more general. Each block can reference multiple parents, meaning blocks mined at the same time are all preserved rather than discarded. The result is a directed acyclic graph of blocks rather than a linear chain.
The hard part is not storing all these blocks — it is reaching consensus on their ordering. Without a clear ordering, you cannot reliably determine which transaction came first, which is essential for preventing double-spends.
GHOSTDAG: Ordering the DAG
Kaspa solves the ordering problem through the GHOSTDAG protocol, a generalization of the GHOST (Greedy Heaviest-Observed Sub-Tree) rule developed in academic research. GHOSTDAG assigns a total ordering to all blocks in the DAG by analyzing the structure of the graph itself. It identifies a main chain — the path of blocks supported by the most cumulative proof of work — and then orders all other blocks relative to that main chain based on when they reference it.
Crucially, no blocks are discarded. Every block produced by an honest miner contributes to the DAG, gets ordered, and has its transactions included. Miners who would have produced orphan blocks on a linear chain instead produce valid blocks that add to the network's security and throughput.
The result is a system where security comes from the total hash rate directed at the network — not just the fraction of hash rate that happened to win each individual slot.
What 10 Blocks Per Second Means in Practice
Kaspa currently targets 10 blocks per second (BPS). Compare this to Bitcoin's roughly 0.0017 blocks per second (one every ten minutes) and Ethereum's pre-merge rate of about 0.07 blocks per second. The difference is not incremental — it is structural.
At 10 BPS, a new block is published to the network every 100 milliseconds. From a user perspective, this has several direct consequences:
- Transactions reach their first block inclusion in seconds rather than minutes.
- Merchants and services requiring one or two confirmations receive them in a timeframe measured in seconds.
- The network processes significantly more transactions per unit of time without requiring layer-two workarounds.
- Fee pressure stays lower because block space is not artificially scarce.
Kaspa's roadmap targets 100 BPS and eventually up to 10,000 BPS as node hardware and network propagation improvements land. Each step maintains the same GHOSTDAG-based security model.
Why This Does Not Sacrifice Security
A common misconception is that faster blocks necessarily means weaker security. In a linear blockchain, that is true: faster blocks raise the orphan rate and create windows where attackers can exploit chain reorganizations. But in Kaspa's blockDAG, there are no orphans to exploit. An attacker attempting a double-spend must outpace the honest miners' total DAG-building work, not just the single-chain work.
GHOSTDAG's security proofs show that as long as the majority of hash power is honest, the protocol converges on a single ordering that is economically prohibitive to reverse. The math was peer-reviewed and published before Kaspa's mainnet launched, making it one of the few proof-of-work protocols with a solid academic foundation for its consensus claims at high block rates.
How This Shapes Kaspa Wallet
Building a wallet for a 10 BPS network requires different engineering assumptions than building one for a slow-block network. Kaspa Wallet tracks the blockDAG state efficiently, displays confirmation depth in a way that makes sense at this cadence, and shows transaction status updates in near real time.
When you send KAS, you do not need to set a long mental timer and wonder whether your transaction is stuck. The protocol's architecture means your transaction enters a block within seconds, and within a handful more seconds, it is deeply confirmed. That speed is not a product of any trick or trade-off — it comes directly from the underlying blockDAG design.
Understanding Kaspa's architecture helps clarify what the wallet is actually doing under the hood. The next time you watch a transaction confirm in seconds rather than minutes, that speed is a direct consequence of a protocol that chose to rethink consensus from the ground up rather than make incremental adjustments to a linear chain.
Get Started With Kaspa Wallet
Kaspa Wallet is a free, open-source, non-custodial wallet built specifically for the Kaspa network. Download for Windows, macOS, or Linux and experience the blockDAG firsthand.