From 707417e1c54f782741bb5cd8c2bcb9fe5e9d9bd6 Mon Sep 17 00:00:00 2001 From: 0xmbcode <152050562+0xmbcode@users.noreply.github.com> Date: Mon, 27 Nov 2023 10:15:59 +0300 Subject: [PATCH 1/2] Update polynomial-commitment-schemes.md Hello, My aim is to submit a pull request to enhance the inclusivity of the prover documentation by replacing singular male pronouns with gender-neutral alternatives. The change aligns with the broader goal of creating content that is welcoming and accessible to individuals of all genders. Changes Made: In the modified version, "their" is a gender-neutral pronoun that doesn't specify the gender of the committer. It's a way to be inclusive and avoid assumptions about the gender of the person being referred to. Thank you. --- .../en/learn/zero-knowledge/polynomial-commitment-schemes.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md b/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md index b5188c4dd..75922b9bf 100644 --- a/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md +++ b/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md @@ -18,7 +18,7 @@ A **[commitment scheme](https://en.wikipedia.org/wiki/Commitment_scheme)** is a Secure commitment schemes have two properties: -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 his original value $v$. +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$. 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$. ## Polynomial commitment schemes From 2585113038a2ffa9073225f9b868e91e354bd3c0 Mon Sep 17 00:00:00 2001 From: Daniel Helm Date: Mon, 15 Jan 2024 13:26:12 -0600 Subject: [PATCH 2/2] Update polynomial-commitment-schemes.md --- .../en/learn/zero-knowledge/polynomial-commitment-schemes.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md b/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md index 75922b9bf..299976d0a 100644 --- a/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md +++ b/src/content/docs/en/learn/zero-knowledge/polynomial-commitment-schemes.md @@ -18,7 +18,7 @@ A **[commitment scheme](https://en.wikipedia.org/wiki/Commitment_scheme)** is a Secure commitment schemes have two properties: -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$. +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$. 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$. ## Polynomial commitment schemes