STARK 101 is a hands-on workshop where we will write a STARK prover in Python, from scratch.
The workshop is built of four segments. Every segment starts with a short talk followed by self-practice. During practice, StarkWare engineers will be walking the aisles to answer questions and help out.
We will assume familiarity with Python and finite field arithmetics.
For the workshop we define a sequence that resembles the well known Fibonacci sequence. In this sequence any element is the sum of squares of the two previous elements. Thus the first elements are:
1, 1, 2, 5, 29, 866, …
All the elements of the sequence will be from the finite field (which means that both squaring and addition is computed modulo p).