There are great tools and tutorials for R1CS proof systems (aka Snarks) but not much is known about programming Starks. Starks have a much more complex constraint language, but in return you can achieve a much better performance.
In this workshop we will
* learn about the mathematical underpinnings of Stark proofs,
* use 0x's OpenZKP library to generate and verify proofs, and
* implement a Stark constraint system.
Target audience: Technical (advanced)
1. Introductory talk about the math. With pacing and Q&A to make sure it is widely understood.
2. Install toolchain run a little demo project
3. Live building a constraint system for a toy problem (Merkle tree, Signature verification, and/or Sudoku)
Prerequisites: Basic familiarity with finite field math and the rust programming language would be useful.
