Zero Knowledge Proofs

This animation uses Peggy and Victor to demonstrate how a zero-knowledge proof works for graph 3-coloring, showing the secret coloring and the commit-and-challenge protocol where Victor randomly checks one edge. It illustrates that while checking a single edge is weak, repeating the process exponentially reduces the chance of a cheater succeeding, while keeping the secret colorings hidden.