🎓 Программирование крипто-экселя

🎓 Программирование крипто-экселя
https://t.me/hacker_embassy/48491

Лекция по написанию программ для zero-knowledge доказательств (by Dmitry Tabalin)

Требования к аудитории: не бояться арфиметики по модулю и многочленов

If you want to create a zero-knowledge proof of 'some program executing correctly', you need to first rewrite the program into a language that the proof system speaks. We are going to look at one of those.

This language is an esolang, which somehow has practical applications:

- no control flow: want to emulate an if? No efficient generic implementation exists!

- all native operations are calculating polynomials over a finite field (aka modulo a prime number). No 'integers'!

- a resulting program is a table with polynomial constraints between it's cells

- xor is best implemented via a lookup table

We are going to write a few simple programs, culminating in implementing a variant of "FizzBuzz" (far from trivial here)!