The point of this is not to actually verify a Sudoku solution without looking at it.
Zero-knowledge proofs are one of the central concepts in computational complexity. Remember that this is an area of study where the fact that something exists often means much more than how to actually construct it. This post was an attempt to explain zero-knowledge in a slightly more fun way instead of the usual example that uses graph isomorphism.
Perhaps it is not the right topic for HN, but it is hardly 'laborious', given the context.
Zero-knowledge proofs are one of the central concepts in computational complexity. Remember that this is an area of study where the fact that something exists often means much more than how to actually construct it. This post was an attempt to explain zero-knowledge in a slightly more fun way instead of the usual example that uses graph isomorphism.
Perhaps it is not the right topic for HN, but it is hardly 'laborious', given the context.