> and is identical to the scheme outlined in this article Would you care to elaborate? In your example, the Verifier (line 2) already has a solution to the pr

> and is identical to the scheme outlined in this article Would you care to elaborate? In your example, the Verifier (line 2) already has a solution to the problem (the number 2). Therefore the Solver (line 1) can't possibly give more information about the solution. In the article's example (graph colouring), the Verifier doesn't know the solution to the problem and just verifies a small part of the solution provided by the Solver (2 vertex each time). The Solver doesn't leak any information about its solution at each iteration since the colours are randomised each time. > I still think calculation is being performed Yes, but this is the whole point of ZKPs. It's called Zero Knowledge, not Zero Computation. > I would argue it is the same as performing a random search on the search space I agree but the fatal flaw in your reasoning is that the Verifier already knows the solution and therefore doesn't learn "new" information. The Solver is just wasting CPU cycles. Disclaimer: I just read the article and have no prior knowledge of ZKPs. This is just my basic understanding.