The Kaspa implementation features a lots of neat options for example Reachability to question the DAG's topology, Block data pruning (with near-long term programs for block header pruning), SPV proofs, and later https://tedliun725625.wikitron.com/908357/kas77_no_further_a_mystery