What do you do when you are having trust issues with everyone? Write your own zkVM to prove all your programs on your own - so we did exactly that. Read the 6 blog series by @soumyathakur44 @m_pandey5 @ManojKGorle here: https://t.co/v0OEhBku4Z Read a simple explainer below👇👇

n/n (n = 6) This is all you need as an introduction to catch up with the DeFi space. If you prefer markdown sources for reading, here's the HackMD version of blog: https://t.co/nBzUNEq6nu

5/n Order book & AMMs Two trading mechanisms for understanding the context of trading along with examples & cases.

4/n Intro to DeFi Pointing out the issue with TradFi & rolling the carpets welcoming DeFi. Diagrams & comparisons are presented showing a better picture.

3/n Intro to Decentralization Decentralization and forms of decentralization are touched along with a comparison to Centralized technology.

2/n Intro to TradFi A look at current traditional centralized finance system along with the various processes & points of centralization and the backings of currencies.

DeFi is popping off on the internet! Get to know about the basics of DeFi through this introductory blog. It's not abacus, be prepared. Explain Like I’m 13: DeFi, by @nikillxh here: https://t.co/ZFogx7e89C 1/n 🧵Read the flow of blog 👇

n/n blog 3 - Plonk Arithmatization: https://t.co/XDDTGEW405 blog 4 - Stark Engine: https://t.co/lbwYUd7NaG blog 5 - Arithmatization: https://t.co/8O6AS2ImGH blog 6 - Putting pieces together:

n-1/n This combined with a look at the zkVM repository takes you through the architecture and process of building. repo: https://t.co/oDp5xD4ioK blog 1 - Introduction: https://t.co/v0OEhBku4Z blog 2 - Stark Prerequisites :

9/n We’ve documented our month long journey of building our very own zkVM in a series of blogposts. It takes a deep dive into the entire workflow of the VM, problems we encountered, and how we tackled them.

8/n There’s more - for the entire zkVM, we didn’t rely on external libraries. From finite field operations to FRI commitment scheme, all cryptographic primitives have been implemented from scratch.

7/n We also identified performance bottlenecks in the proof generation process and introduced optimizations to accelerate computation.

6/n ...Commits these codewords using a Merkle tree. Gets challenges using Fiat-Shamir. It then enforces AIR constraints, and runs FRI protocol to prove low-degree of the resulting polynomials.

5/n Our STARK prover works in the following way: It builds base tables for processing, memory, instruction, input and output, from the execution trace. Then interpolates the columns of these tables, and evaluates the resulting polynomials on a common domain to get codewords....

4/n Why use Brainfuck ISA? Because it’s tiny and Turing complete, with just 8 instructions. Which makes it easy to model and prove.

3/n We take our Brainfuck program, compile and run it, to give us a computation matrix (or execution trace) representing the state changes of the entire program step by step. This trace is what we prove.

2/n The idea is quite simple - we proved the computational integrity of Brainfuck ISA in Rust, using STARKs and FRI commitment scheme. Along with writing all required cryptographic libraries from scratch. Sounds fun? Let’s break it down a bit.

Hello {Blockchain | IIT} World!!