Skip to content

Commit 2585113

Browse files
authored
Update polynomial-commitment-schemes.md
1 parent 707417e commit 2585113

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ A **[commitment scheme](https://en.wikipedia.org/wiki/Commitment_scheme)** is a
1818

1919
Secure commitment schemes have two properties:
2020

21-
1. **Binding**: once publishing the commitment $c$, the committer should not be able to find some other value $v’$ distinct from $v$ that also corresponds to $c$. I.e., the commitment $c$ binds the committer to their original value $v$.
21+
1. **Binding**: once publishing the commitment $c$, the committer should not be able to find some other value $v’$ distinct from $v$ that also corresponds to $c$. I.e., the commitment $c$ binds the committer to the original value $v$.
2222
2. **Hiding**: the verifier should not be able to learn any information about the original value $v$ from the commitment $c$. I.e., the commitment $c$ hides all information about the original value $v$.
2323

2424
## Polynomial commitment schemes

0 commit comments

Comments
 (0)