1. Cryptographic Hashing

Every block contains a hash of its own data and the hash of the previous block. 1.

If someone tries to alter the data in a block, its hash changes—breaking the link to the next block. 2.

This would require recalculating all subsequent hashes, which is computationally infeasible on a large scale.