We are going to delve into arithmetization, particularly focusing on the R1CS method widely used in SNARK proof systems. Our journey will reveal how R1CS transforms programs into polynomial forms. In previous posts, we delved into the fundamental primitives of cryptography and mathematics. Now, it’s time to explore the Zero-Knowledge Proof (ZKP) systems we’ve previously superficially talked about.PrerequisitesBefore we dive deep, there are a few basic prerequisites you should be familiar with...