The Kaspa implementation includes a number of interesting options for instance Reachability to question the DAG's topology, Block data pruning (with near-upcoming strategies for block header pruning), SPV proofs, and later subnetwork aid which is able to make foreseeable future implementation of layer 2 methods less difficult. If you believe this