The Kaspa implementation features a lots of great functions such as Reachability to question the DAG's topology, Block information pruning (with in close proximity to-long run strategies for block header pruning), SPV proofs, and afterwards subnetwork help which can make long run implementation of layer 2 answers less difficult. If you think this