This blog post, authored by Xiao Wang and contributed to by several researchers, is the first in a series exploring zero-knowledge proofs (ZKPs) from Chainlink Labs Research Team, focusing on their applications in blockchain and oracle technologies. The post distinguishes between non-interactive zero-knowledge proofs (NIZKs), which are valued for their transferability and use in blockchain due to their succinct nature, and interactive zero-knowledge proofs (IR-ZKPs), which involve communication between prover and verifier and are more suited for oracle technologies. While NIZKs are efficient for verification, they can be resource-intensive for the prover, whereas IR-ZKPs offer scalability, cheap computation, and minimal memory use, making them ideal for scenarios involving small, known parties. The series aims to delve into the complexities of memory use in zero-knowledge protocols, explore small memory NIZKs, and discuss recent advancements in interactive commitments, ultimately addressing the engineering challenges and future research directions in interactive ZKPs.