1063.pdf
eprint.iacr.org · 10,463 words · saved by 1 readers
N/A
Cairo – a Turing-complete STARK-friendly CPU architecture Lior Goldberg Shahar Papini Michael Riabzev February 2025* Abstract 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…
related reading
- Introduction - The Cairo Programming Languagebook.cairo-lang.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- A shallow dive into formal verificationvitalik.eth.limo
- 370.pdfeprint.iacr.org
- Cairo Programming Languagecairo-lang.org
- STARK-paper.pdfstarkware.co
- 1021.pdfeprint.iacr.org
- Building dApps that Last: Why Cairo is the Winner Programming Language for Web3 Devshackernoon.com
- [2606.05433] Zero knowledge verification for frontier AI training is possiblearxiv.org
- eSTARK: Extending STARKs with Argumentseprint.iacr.org
- 1022.pdfeprint.iacr.org
- Technical Summary | Perama’s notes.perama-v.github.io