The Kaspa implementation features a great deal of great functions which include Reachability to query the DAG's topology, Block knowledge pruning (with in close proximity to-long run ideas for block header pruning), SPV proofs, and later subnetwork assist which can make long run implementation of layer two methods much simpler. If you believe this