STARK is supposedly a technology that is good for proving the correct evaluation of program, or calculation since the proofs can be built in nlogn time, and the verification can be done in logn time, where n is the number of cycles for the calculation.
This looks like a great resource! Thanks for sharing.
> STARKs, not SNARKs, will dominate
As an uneducated person, I perceive STARKs like hash-based signatures. A lot of hashing, it works, but it's bloated and unless quantum computers become a thing one day (highly unlikely) they might never get used.
Now, I might be completely wrong, and depending on the application these might offer very competitive benefits. I'm looking forward to be proven wrong while reading this tutorial :)