This tutorial covers the design of a STARK engine for Brainfuck.<p>A STARK [1] allows you to prove the correct execution of a computer program. The verifier can verify the resulting proof with less resources than it takes to naïvely re-execute the program.<p>Brainfuck [2] is a Turing-complete programming language that corresponds to a relatively straightforward instruction set architecture.<p>With this tutorial you will be able to prove and verify the correct execution of arbitrary Brainfuck programs.<p>[1]: <a href="https://aszepieniec.github.io/stark-anatomy/" rel="nofollow">https://aszepieniec.github.io/stark-anatomy/</a>
[2]: <a href="https://en.wikipedia.org/wiki/Brainfuck" rel="nofollow">https://en.wikipedia.org/wiki/Brainfuck</a>