4 ms·
a bit laborious for a probability based solution. was expecting some clever trick based on the headline.
by nazgulnarsil 17y ago
a bit laborious for a probability based solution. was expecting some clever trick based on the headline.
- randomwalker 17y agoThe 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.
- amichail 17y agoThat you can do this at all might be surprising to people unfamiliar with zero-knowledge protocols.