The Kaspa implementation features a large amount of amazing capabilities like Reachability to query the DAG's topology, Block details pruning (with in close proximity to-foreseeable future strategies for block header pruning), SPV proofs, and afterwards subnetwork help which can make long run implementation of layer 2 answers a lot easier. Any coo