Let's do Arithmetic: Why are polynomials used in succinct ZK proofs?

STARK @ Home

Cover Photo

Apr

2

4:00pm

Let's do Arithmetic: Why are polynomials used in succinct ZK proofs?

By STARK @ Home

Nearly all deployed ZKP systems (including STARKs and SNARKs) encode computations as polynomials over finite fields. Why is this so? Which magic properties of polynomials make them such a powerful and useful tool in proofs of computational integrity?

hosted by

STARK @ Home

share

Open in Android app

for a better experience