THE 2-MINUTE RULE FOR KAS77

The Kaspa implementation features a great deal of interesting capabilities such as Reachability to query the DAG's topology, Block information pruning (with close to-future programs for block header pruning), SPV proofs, and afterwards subnetwork support which is able to make foreseeable future implementation of layer two alternatives less difficul