2 citations · 2 across the 4 of their papers we have counts for
4 papers
Formal verification of the S-two AIR
Jeremy Avigad, Anat Ganor, Lior Goldberg +4
StarkWare's S-two prover provides an efficient means for establishing, on blockchain, that a program written in the Cairo virtual machine language runs to completion. The latter cl…
A Proof-Producing Compiler for Blockchain Applications
Jeremy Avigad, Lior Goldberg, David Levit +2
CairoZero is a programming language for running decentralized applications (dApps) at scale. Programs written in the CairoZero language are compiled to machine code for the Cairo C…
A verified algebraic representation of Cairo program execution
Jeremy Avigad, Lior Goldberg, David Levit +2
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…
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty +1
For smooth finite fields (i.e., when factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomi…