Direct implementation of a simple IZK proof system that is able to prove
knowledge of
There's a long explanation provided in my blog.
Broadly, this is what is done:
- Convert the statement into a boolean expression.
- Prove the boolean expression by:
- a) Convert it to a 3-colorable graph.
- b) Prove a coloring exists.
The code essentially does step (2.b), everything else is done offline.