Update Description

Uncle Stretch 2025-10-08 19:25:43 +02:00
parent 2fa540c366
commit 1ce4a237df

@ -56,7 +56,23 @@ $$ s*G - e*H_{\text{agg}}= R - \sum_i^m (e*(a_i * X_i) + b*R_{\text{i1}} + d*R_{
## Reporting issues and feedback
If you find any issue with code and/or the formula, please report it via one of the links below or open an issue on the website if you have an account. Contributions, extensions, and questions are welcome.
We welcome feedback and bug reports from knowledgeable contributors. If you discover any issues or have suggestions, please contact us via email or any of the social links below. If you have an account here, you may also submit a free-form issue.
We are currently investigating the following questions:
1. Is it feasible to construct arguments in polynomial time that cause the verifiers equation to hold?
$$ R', s', message', a_{\text{il}}', a_{\text{ir}}', X_i', R_{\text{i1}}', R_{\text{i2}}'$$
$$ s'*G + \sum_i^m (e*(a_i' * X_i') + b*R_{\text{i1}}' + d*R_{\text{i2}})' = R' + e*H_{\text{agg}} $$
2. Can information about missing signers be consolidated into a single entry?
$$ \sum_i^m (e*(a_i * X_i) + b*R_{\text{i1}} + d*R_{\text{i2}}) = e*(a' * X') + b*R_{\text{1}}' + d*R_{\text{2}}' $$
3. Are parameters $b$ and $d$ sufficiently robust and indistinguishable from each other?
4. Are there any other issues you can identify?
Email: support@ghostchain.io