You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I am interested in your project. What is the current status? How long more till implementing a range proof/pedersen Hash? I would love to help in getting to the point of Pedersen hashes if you would allow :)
The text was updated successfully, but these errors were encountered:
Thanks for the interest, I will split up your comment into three:
Status:
Lookups have been implemented for bivariate functions.
Rangeproof:
You could do rangeproofs with the look up table, but it will not be optimal in terms of proof size and maybe proof times too. The Rangeproof algorithm that is stated in the paper is a TODO, I've done a bit of work on it offline.
Pedersen Hashes:
For Pedersen hashes inside of a circuit, I do not know enough, so I will need to inspect a few circuits and get back to you on this. If you already know how to implement this with a lookup, then please feel free to PR :)
I will also add an example folder also with the in-effcient rangeproof until the more efficient version is added and a few lookup examples. Did that answer all of your questions?
Hi, I am interested in your project. What is the current status? How long more till implementing a range proof/pedersen Hash? I would love to help in getting to the point of Pedersen hashes if you would allow :)
The text was updated successfully, but these errors were encountered: