Content

Warp the way to StarkNet

From Elliptic Curves to ZK-SNARKs and Beyond

The Cairo programming language and STARK technology provide an efficient means of recording computational results on blockchain. But how can we be sure that the results mean what we think they mean? This episode is dedicated to answer this question

Team StarkWare talks with developers about the capabilities of StarkNet and how to start using it, in this episode of our [email protected] series.

Prof. Madhu Sudan discussing data digitization and how to protect and ensure the data we store is error proof.

Computational Integrity - why is it important and how do we guarantee it?

Moving DeFi to layer 2 (L2) - with Andre Cronje and Louis Guthmann

Prof. Avi Wigderson discussing the highlights along the journey that started with the invention of Interactive Proofs.

Recursion in proof systems, as applied to recursive STARKs.

The intuition, security, and math behind the transformation of interactive oracle proofs into non-interactive proofs. With Alessandro Chiesa (Prof. @ Berkeley, Co-Founder & Chief Scientist @ StarkWare).

Scalable proof systems can have (theoretically) one set of constraints to enforce the computational integrity of any computation. This episode's discussion is all about the best way to achieve this.

Unfair extraction of value from transactions sitting in the mempool and waiting to be incorporated in a block has become a serious problem in Ethereum. In this episode, we'll discuss the "Dark Forest" problem and explain how STARKs can help mitigate it. With our special guests: Dan Robinson of Paradigm, and Arthur Breitman

You rely on the Inclusive Accountability offered by a public blockchain like Ethereum. Your users can't afford rising gas costs. And you need to scale up more than ever. A STARK L2 solution is one of the options you're considering. With our special guest: Avihu Levy

Social distancing may slow the spread of viruses, but mathematical distancing is provably crucial for maintaining STARKs healthy and sound. With our special guest: Professor Swastik Kopparty.

Philosophy intersect Math intersect CS intersect Crypto.

We are releasing our open-source ethSTARK library and had special guest stars to help us announce it: Vitalk Buterin who needs no introduction, and David Levitt-Gurevich who leads the ethSTARK effort at StarkWare

STARK-Powered VDFs (Verifiable Delay Functions) with special guest stars Jo Bonneau, Justin Drake, and StarkWare's VeeDo team members Kinneret Segal and Tom Brand.

We are in the midst of a Cambrian Explosion in the field of cryptographic proofs of computational integrity (CI). While a couple of years ago there were about 1–3 new systems a year, the rate has picked up so much that today we are seeing this same amount monthly, if not weekly. In this STARK @ Home talk, Eli Ben-Sasson suggests a method to better categorize and understand the different systems.

Diving deep into FRI - Fast Reed-Solomon Interactive protocol (and a cool trick at the end)

How do parrots check their phone bill? And what does it have to do with the PCP theorem?

How do you map a program to a polynomial? Eli Ben-Sasson waves his hands in the air to explain this concept

The pretty properties of polynomials that make them useful in succinct ZK proofs.

FFT vs PPC