Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Research topics #57

Open
PopcornPaws opened this issue Mar 11, 2023 · 0 comments
Open

Research topics #57

PopcornPaws opened this issue Mar 11, 2023 · 0 comments
Assignees
Labels
research Research notes on a specific topic

Comments

@PopcornPaws
Copy link
Contributor

Description

First of all, Arkworks has implementations for secp256k1 and it's cycle secq256k1curve that we could use. Those implementations are most probably better tested and more efficient than our toy implementation. Furthermore, Pedersen commitments are also implemented in Arkworks' [crypto primitives library]((https://github.com/arkworks-rs/crypto-primitives) that we could use to replace our Pedersen implementation.

Secondly, there's an efficient ZK-ecdsa library called Spartan-ECDSA that we could check out. It also builds upon the secq256k1 cycle which results in more efficient and faster proofs. As the name suggests, it is forked from the Spartan zkSNARK library that doesn't require trusted setup.

@PopcornPaws PopcornPaws added the research Research notes on a specific topic label Mar 11, 2023
@PopcornPaws PopcornPaws self-assigned this Mar 11, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
research Research notes on a specific topic
Projects
None yet
Development

No branches or pull requests

1 participant