The Kaspa implementation includes a lot of cool attributes for instance Reachability to question the DAG's topology, Block information pruning (with in close proximity to-potential programs for block header pruning), SPV proofs, and later on subnetwork assistance which can make potential implementation of layer two methods easier. We determined an