2nd Zero-Knowledge Workshop in São Paulo with Marcello Bardus and Bartosz Nowak (At Herodotus Dev)

​🔥 ZK Workshop #2 — The Magic of Polynomials & FFTs
We're back with the second edition of our Zero-Knowledge Workshop series, and this time we’re diving deep into the core mechanics that make verifiable computation possible.

​In this session, you’ll build a powerful mental model for how ZKPs actually work — starting from scratch.

​🔍 What you’ll explore:

• ​The power of Finite Fields: perfect arithmetic that escapes the limitations of standard computer math.

• ​Arithmetization: turning any computational statement into the universal language of polynomials.

• ​How a verifier can check massive computations with just one probabilistic check.

• ​The O(n²) bottleneck in polynomial multiplication – and its elegant solution: the Fast Fourier Transform (FFT).

• ​How the FFT brings ZK from theory to practice with its blazing-fast O(n log n) performance.

​Whether you're into cryptography, compilers, or just love seeing abstract math come to life in real systems — this one's for you.

​Herodotus website: https://herodotus.dev/