✳flâneur — a map of the web's best reading

Arithmetization I. Stark Math part 2: execution trace and… | by StarkWare | StarkWare | Medium

medium.com · 2,047 words · saved by 1 readers

This is the second part in our series about the math behind STARKs (first part here), and it is the first of two posts about arithmetization. By the time you complete this post, you should have a good idea of what execution trace and polynomial constraints are, and how a Computational Integrity statement gets transformed into these. We will start with a simple example of a supermarket receipt, and move on to a slightly more complex one, that of Collatz sequences, that relates to a well-known open problem in number theory. We will assume basic familiarity with polynomials over finite fields, and binary representations of integers. The goal of the STARK protocol is to verify computations succinctly and transparently. The first step in STARK is called arithmetization, and it is the translation (often referred to as ‘reduction’) of the problem of verifying a computation to the problem of checking that a certain polynomial, which can be evaluated efficiently on the verifier’s side (this is

Arithmetization I StarkWare 9 min read · Feb 20, 2019 -- 7 Listen Share This is the second part in our series about the math behind STARKs (first part here ), and it is the first of two posts about arithmetization . Press enter or click to view image in full size Photo by Gayatri Malhotra on Unsplash By the time you complete this post, you should have a good idea of what execution trace and polynomial constraints are, and how a Computational Integrity statement gets transformed into these. We will start with a simple example of a supermarket receipt, and move on to a slightly more complex one,

Explore this link on the map →

saved by

related reading