> how does the server confirm that the proof is correct? The point of proof-of-work algorithms is to be hard to compute but easy to verify. As a simplified ex

> how does the server confirm that the proof is correct? The point of proof-of-work algorithms is to be hard to compute but easy to verify. As a simplified example, a proof-of-work might be to take some input and find a corresponding salt that leads to a sha256 with 10 leading zeros. The user works hard to find that salt (the proof-of-work) using some brute force search, but the server easily verifies that the proof is correct because checking a sha256 is easy. So the proof is verifiable by the definition of the algorithm.