placing your order...Don't refresh or navigate away from the page.
In this liveProject, you’ll use zero-knowledge proof (ZKP) to reveal that a super hard Sudoku puzzle has been solved, but without sharing the answer. To do this you’ll implement a prover and a verifier that are sharing a Sudoku board. The prover will produce a proof for knowing a solution, while the verifier will use the proof to get convinced and catch a cheating prover. You’ll build a ZKP based on the classical GMW zero-knowledge proof of 3-Colorability of a graph, using the Rust language.
The liveProject is for intermediate Rust developers. To begin this liveProject you will need to be familiar with the following:TOOLS
In this liveProject, you’ll explore cryptography for collaborative communication that offers privacy enhancement.
geekle is based on a wordle clone.