How does Kaspa solve the block ordering problem in a DAG?

Kaspa solves the ordering problem by adding an additional Merkle Tree. In a standard blockchain, each block points to only one previous block, so order is always clear. Kaspa's blockDAG lets blocks point to multiple previous blocks, which means the order between parallel blocks cannot be known directly. A Merkle Tree is order-dependent by design — its entire purpose is to preserve order — so when order is ambiguous, one Merkle Tree is not enough. Kaspa resolves this by introducing a second Merkle Tree to handle the ordering that would otherwise be undefined. For a beginner, this means Kaspa's design includes specific engineering to keep data consistent even when blocks exist in parallel — something a plain Merkle Tree cannot do on its own.