Is Kaspa's pruning algorithm mathematically proven secure?

Yes — Kaspa's pruning algorithm has a formal mathematical security proof. It was published in a peer-reviewed paper on the IACR ePrint Archive (reference 2021/623), where independent cryptographers examined and validated the approach. The proof shows that pruning discards only redundant block data while preserving chain integrity — nothing load-bearing is removed. For a beginner, this is significant because it means the claim isn't just asserted by the team; it is mathematically demonstrated in peer-reviewed literature.