flâneur

Arithmetization II. “We Need To Go Deeper” | by StarkWare | StarkWare | Medium

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

This is the third post in our STARK Math series, if you haven’t read the first and the second posts, we recommend you do so before reading on. Fair warning: this one is a bit mathier than its predecessors. In the previous post we introduced arithmetization — the process of transforming a Computational Integrity (CI) statement into checking whether a polynomial is of low degree. This transformation allows us to achieve succinct verification, where the verifier of the CI statement requires exponentially less resources than those needed for naive replay. In the previous post we zoomed into the first step in this transformation through the example of transforming a CI statement about a Collatz sequence into an execution trace and a set of polynomial constraints. In this post we take the next step and show — using a Fibonacci sequence this time — how the prover can combine the execution trace and the polynomial constraints to obtain a polynomial that is guaranteed to be of low degree if and

Arithmetization II “We Need To Go Deeper” StarkWare 11 min read · Mar 14, 2019 -- 12 Listen Share This is the third post in our STARK Math series, if you haven’t read the first and the second posts, we recommend you do so before reading on. Fair warning: this one is a bit mathier than its predecessors. Press enter or click to view image in full size Photo by Iswanto Arif on Unsplash Recap In the previous post we introduced arithmetization — the process of transforming a Computational Integrity (CI) statement into checking whether a polynomial is of low degree. This transformation allows us to

saved by

related reading