The Kaspa implementation features a lot of neat options for instance Reachability to question the DAG's topology, Block knowledge pruning (with close to-long run programs for block header pruning), SPV proofs, and later https://lucyvtyp774703.get-blogging.com/profile