Understanding Zero-knowledge proofs through illustrated examples

• snarky-sudoku

  1 43 0.0 Solidity

  Zero-knowledge Sudoku using zk-SNARKs

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).

• zkp-learning-in-public

  1 64 0.0 Solidity

  My journey learning zero knowledge proof technologies in public! Feedback, help and contributions very much welcome

In additional to Nalin's great sudoku example elsewhere, he's a couple of my repos that use SNARKS:

1) Some experiments/learnings https://github.com/JofArnold/zkp-learning-in-public

2) A blockchain-based Dungeon crawler built for a hackathon that uses a SNARK (Circom, snarkjs) to validate that the user hasn't cheated when getting to the end of the maze https://github.com/Derked/FantasyCampaign

• WorkOS

  workos.com sponsored

  The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

  

• FantasyCampaign

  2 14 5.0 TypeScript

  Turn based fantasy campaign game for chainlink hackathon

In additional to Nalin's great sudoku example elsewhere, he's a couple of my repos that use SNARKS:

1) Some experiments/learnings https://github.com/JofArnold/zkp-learning-in-public

2) A blockchain-based Dungeon crawler built for a hackathon that uses a SNARK (Circom, snarkjs) to validate that the user hasn't cheated when getting to the end of the maze https://github.com/Derked/FantasyCampaign

Suggest a related project