Proof systems allow one party to prove to another party that a certain statement is true. Most existing practical proof systems require that the statement will be represented in terms of polynomial equations over a
finite field. This makes the process of representing a statement that one wishes to prove or verify rather complicated, as this process requires a new set of equations for each statement.
Various approaches to deal with this problem have been proposed.
We present Cairo, a practically-efficient Turing-complete STARK-friendly CPU architecture. We describe a single set of polynomial equations for the statement that the execution of a program on this architecture is valid. Given a statement one wishes to prove, Cairo allows writing a program that describes that statement, instead of writing a set of polynomial equations.
Oh la perle que je découvre sur le tard : un rechargeur automatique de page web quand on modifie du CSS/HTML/JS. Couplé à un système de détection des changements avec watchdog, et on a là un truc bien cool.
Programming is based on mathematics in the way that cooking is based on chemistry. All of cooking is chemistry but you don’t have to know the periodic table to cook. Even if you suck at math, programming still might be your jam.