The Kaspa implementation features a wide range of neat attributes such as Reachability to question the DAG's topology, Block knowledge pruning (with in close proximity to-long run programs for block header pruning), SPV proofs, and afterwards subnetwork help that can make potential implementation of layer two remedies less difficult. We discovered