A journey into the world of Zero-Knowledge proofs
We embark on a new journey solely dedicated to ZK technology!
Time for our first basic mathematical concepts!
Equipped with finite fields and polynomials, it’s time to take a look at our very first proving system!
As we get closer to general proving systems, we are required to look at computation models, which brings us to circuits!
Before moving onto new proving systems, we must introduce a very necessary tool!
We now move forward to our first truly general computation correctness proving mechanism!
A broader look at the connection between different computation models, and the importance of arithmetic circuits
Time for hashes to take the stage, bringing along a few cool tricks!
After stocking up with hashes, now's time for another big protagonist of this ZK story!
Time to start building on top of the primitives we know so far!
With commitment schemes at hand, we turn our attention once again to proving systems
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
The next step in our journey will see us looking at a new and important commitment mechanism, designed for polynomials
arkana
