Why does Kaspa consider transaction acceptance order more important than exclusion proofs?

Kaspa's protocol designers argue that proving the order in which transactions were accepted is more valuable than the existing sorted-Merkle exclusion-proof optimization. A proof of exclusion is a cryptographic guarantee that a specific transaction was NOT included in a block; the sorted AcceptedIDMerkleRoot was built to make such proofs cheaper. However, two problems limit its usefulness: no application on Kaspa currently uses this feature, and proving exclusion over any meaningful time window — such as a single day — would require a separate proof for every chain block in that period, making the overall proof linearly long regardless of the tree sorting. For anyone building on Kaspa, this signals where the protocol's priorities lie: demonstrating when and in what order transactions were accepted is seen as the more foundational capability.