POPL 2022 (series) / CPP 2022 (series) / CPP 2022 / A verified algebraic representation of Cairo program execution
A verified algebraic representation of Cairo program executionRemote
Mon 17 Jan 2022 15:55 - 16:20 at Salon III - Security and Distributed Systems Chair(s): Alwyn Goodloe
Cryptographic interactive proof systems provide an efficient and scalable means of verifying the results of computation on blockchain. A prover constructs a proof, off-chain, that the execution of a program on a given input terminates with a certain result. The prover then publishes a certificate that can be verified efficiently and reliably modulo commonly accepted cryptographic assumptions. The method relies on an algebraic encoding of execution traces of programs. Here we report on a verification of the correctness of such an encoding of the Cairo model of computation with respect to the STARK interactive proof system, using the Lean 3 proof assistant.
Mon 17 JanDisplayed time zone: Eastern Time (US & Canada) change
Mon 17 Jan
Displayed time zone: Eastern Time (US & Canada) change
15:30 - 17:10 | Security and Distributed SystemsCPP at Salon III Chair(s): Alwyn Goodloe NASA Langley Research Center | ||
15:30 25mTalk | Reflection, Rewinding, and Coin-Toss in EasyCryptRemote CPP Pre-print Media Attached | ||
15:55 25mTalk | A verified algebraic representation of Cairo program executionRemote CPP Jeremy Avigad Carnegie Mellon University, USA, Lior Goldberg Starkware Industries Ltd., David Levit Starkware Industries Ltd., Yoav Seginer cdl-lang.org, Netherlands, Alon Titelman Starkware Industries Ltd. Pre-print | ||
16:20 25mTalk | Formal Verification of a Distributed Dynamic Reconfiguration ProtocolInPerson CPP William Schultz Northeastern University, Ian Dardik Northeastern University, Stavros Tripakis Northeastern University Pre-print | ||
16:45 25mTalk | Forward build systems, formallyInPerson CPP Link to publication |