[nibnalin]

It's kind of mind-blowing that the universe allows us to do this at all: Convincingly prove that you have a solution to a puzzle without revealing anything about the solution itself.

On the sudoku example, I built out a playable version of zero-knowledge sudoku a few months ago: https://github.com/nalinbhardwaj/snarky-sudoku

It doesn't use the same strategy as the article, but the underlying idea of non-interactive SNARK based proof is the same (just using the more general circom circuit library to compile the constraints into a ZK-SNARK).

[Gehinnn]

We still don't know if the universe allows us to do that. If P=NP ZKPs are worthless.

[betwixthewires]

It's pretty convincing so far though that P != NP, all NP problems can be reduced to the four color map problem, and that means that if any one NP problem can be shown to be P, then all NP problems can be solved in polynomial time. I believe there are huge bounties and lots of researchers attempting to do this with any number of NP problems.

Of course, it could be that someone does it one day, and if so modern cryptography is useless, but I highly doubt it.

[Ar-Curunir]

For some settings we have unconditional zero-knowledge; we don’t need to make any assumptions. This is called perfect ZK or statistical ZK