Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Cairo – a Turing-complete STARK-friendly CPU architecture |
|---|---|
| What the text proposes | A CPU whose every instruction was chosen so that a STARK can prove 'this program ran'. You write a program instead of a new set of polynomial equations for each statement. The paper is the machine, not a network's throughput. |
| Who may write | Lior Goldberg, Shahar Papini and Michael Riabzev |
| What is settled | A read-only memory of instructions and a mutable memory of values. |
| Load-bearing assumption | A proof of execution is not a consensus protocol and not data availability. |
| What this library says afterwards | The paper does not establish the security of a particular proving stack or a particular chain. |
| Rights | Official external source only |