For example, Secure Hashing Algorithm 256 (SHA-256) ... Once the problem is solved, each node compares the block header by hashing it twice and comparing its result to the new block’s hash.