Creator of Arkana. Passionate about mathematics, cryptography, and computer science.
No trusted setup, no pairings, and no problem: STARKs take a radically different path, and it starts with a new way to think about computation.
A look at the bridge between the representation layer of problems, and the proving layer.
We explore the mysterious and misunderstood concept of entropy, and discover how it pops up in unexpected places.
Before we go on any further, we must stop and take a look at one of the most important algorithms enabling most of the things we're doing
We now look at a second technique to build SNARKs that aims to fix some of the shortcomings in our previous exploration.
Now that we understand zero knowledge, we must take some time to inspect how it fares under non-interactivity.
The next step in our journey will see us looking at a new and important commitment mechanism, designed for polynomials
With commitment schemes at hand, we turn our attention once again to proving systems
All the pieces are finally in place. Time to build our first real zk-SNARK.
It's finally time to formalize what "zero knowledge" truly means
Time to start building on top of the primitives we know so far!