Hello Web3!
My first paragraph article
ZK VS FHE
From https://learn.0xparc.org/ 🔑 Zero-knowledge proofs are a way to prove a statement is true without revealing anything beyond the truthiness of the statement. In the map 3-coloring problem, ZK allows you to prove that you can color in each region on a map using one of three colors, such that no two adjacent regions are the same color, without having to show how you colored the map. Fully Homomorphic Encryption let’s you make computations without decrypting the data you are working with.
ZK VS FHE
From https://learn.0xparc.org/ 🔑 Zero-knowledge proofs are a way to prove a statement is true without revealing anything beyond the truthiness of the statement. In the map 3-coloring problem, ZK allows you to prove that you can color in each region on a map using one of three colors, such that no two adjacent regions are the same color, without having to show how you colored the map. Fully Homomorphic Encryption let’s you make computations without decrypting the data you are working with.
My Circom learning Journey
I will be learning Circom from this resource https://learn.0xparc.org/materials/circom/learning-group-1/circom-1/ and I will be posting about it here. If you are interested in learning Circom or ZK stuff as a whole, you are more than welcome to follow me and hop on board. In my next post I will explain what Circom is and how it is used with ZK tech.
My Circom learning Journey
I will be learning Circom from this resource https://learn.0xparc.org/materials/circom/learning-group-1/circom-1/ and I will be posting about it here. If you are interested in learning Circom or ZK stuff as a whole, you are more than welcome to follow me and hop on board. In my next post I will explain what Circom is and how it is used with ZK tech.
