Skip to content

Commit

Permalink
Merge pull request #312 from leopardracer/master
Browse files Browse the repository at this point in the history
fix: typos in documentation files
  • Loading branch information
miguelis authored Dec 18, 2024
2 parents f263279 + 02eede2 commit c9e029f
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions mkdocs/docs/circom-language/tags.md
Original file line number Diff line number Diff line change
Expand Up @@ -29,11 +29,11 @@ template A(){
...
}
```
The input array `in` is declared with the tag `binary`. This tag means that each signal in the array is always expected to be `0`or `1`, in order to compute the corresponding number correctly.
The input array `in` is declared with the tag `binary`. This tag means that each signal in the array is always expected to be `0` or `1`, in order to compute the corresponding number correctly.

Then, whenever the previous template is instantiated, the compiler checks if the array `a` assigned to the input array has the tag binary, since `in` has the tag `binary` in its declaration. If it does not, an error is reported. Notice that the compiler also checks if both arrays have the same size.

It is important to highlight that the compiler does never make any check about the validity of the tags. It is the programmer's responsibility to include the constraints and executable code to guarantee that the intended meaning of each signal is always true.
It is important to highlight that the compiler never does make any check about the validity of the tags. It is the programmer's responsibility to include the constraints and executable code to guarantee that the intended meaning of each signal is always true.

When doing a substitution from a tagged signal to another signal, the tags are always inherited by it (even if it is not declared with it). For instance,

Expand Down Expand Up @@ -127,4 +127,4 @@ bus Person{
signal name[50];
Book {old} name;
}
```
```

0 comments on commit c9e029f

Please sign in to comment.