arnaucube/circom
1
0
Fork 0
mirror of https://github.com/arnaucube/circom.git synced 2026-02-07 03:06:42 +01:00
Code Issues Packages Projects Releases Wiki Activity

Some readme corrections

Browse Source
This commit is contained in:
Jordi Baylina
2018-09-12 11:24:03 +02:00
parent b1703797d2
commit 2ebd68be6f
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@@ -108,9 +108,9 @@ out[i] * (out[i] -1 ) === 0;
Let's now create a 32bits adder. Let's now create a 32bits adder.
This operation could be done directly by adding a simple constraint `out === in1 + in2`, This operation could be done directly by adding a simple constraint `out === in1 + in2`,
but doing this the operation would not be module `2**32` but `r`, where `r`is the range of the elliptic curve. In the case of regular (regular??) zkSNARKs this number is typically some prime close to 2**253. but doing this the operation would not be module `2**32` but `r`, where `r`is the range of the elliptic curve. In the case of the zCash current implementation of zkSNARKs this number is typically some prime close to 2**253.
So, the strategy we will follow will be to first convert a number to binary, then do the addition using the binary representation (regular electronic circuit) (<- què vols dir amb això de regular electronic circuit??) and finally change it back to a number. (?? You mean base10?) So, the strategy we will follow will be to first convert a number to binary, then do the addition using the binary representation like in regular electronic circuits, and finally change it back to a number.
To do this, we create 3 files: `bitify.circom`, `binsum.circom` and `sum_test.circom`. To do this, we create 3 files: `bitify.circom`, `binsum.circom` and `sum_test.circom`.