Kaspa uses proof of work and a blockDAG, a directed acyclic graph of blocks, in place of a single chain.

What does blockDAG solve?

A block can reference multiple parents. Blocks created in parallel can remain part of a shared structure. The graph alone does not determine which of two conflicting transactions will be accepted.

What does GHOSTDAG solve?

It helps derive an ordering of blocks. It is an efficient greedy variant of the PHANTOM approach, using structural block classification and cumulative work. Blue and red do not simply mean honest and fraudulent.

10 BPS: what it does and does not mean

Mainnet targets ten blocks per second. This is not the same as ten transactions per second: each block can include multiple transactions.

Fast inclusion in a block is different from absolute irreversibility. Ordering security is conditional and grows with additional computational work on the network.

Verify the details