The Kaspa implementation features a large amount of neat characteristics for example Reachability to query the DAG's topology, Block information pruning (with close to-upcoming strategies for block header pruning), SPV proofs, and later subnetwork aid that will make foreseeable future implementation of layer 2 answers much easier. We determined an