How does Kaspa's SequencingCommitment chain blocks together cryptographically?

Each block's SequencingCommitment is calculated by hashing together two things: the current block's AcceptedIDMerkleRoot and its selected parent's SequencingCommitment, using the blake2b algorithm that Kaspa already uses for Merkle trees throughout the protocol. A hash is a fixed-length fingerprint produced from any input — combining a parent's fingerprint with a child's creates a new fingerprint that implicitly encodes both. Because every block folds its parent's SequencingCommitment into its own calculation, each block in the DAG carries a tamper-evident record of the entire sequence of accepted transactions that came before it. For a beginner, this means the design makes it mathematically verifiable — not just trusted — that the order of accepted transactions has not been altered anywhere in the chain's history.