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

Discussing Geppetto solution to aggregate challenges #186

Closed
1 of 3 tasks
nicola opened this issue Sep 14, 2018 · 11 comments
Closed
1 of 3 tasks

Discussing Geppetto solution to aggregate challenges #186

nicola opened this issue Sep 14, 2018 · 11 comments
Assignees

Comments

@nicola
Copy link
Contributor

nicola commented Sep 14, 2018

From Ben: "aggregation just requires setting the field of the second snark to be the order of the curve in the first"

Next steps are:

@porcuquine
Copy link
Collaborator

@nicola Have we concluded that this is the strategy we will take? If we have decided that, then I think this resolves #157. If we have concluded this, but #157 still requires more investigation into the options enumerated above, can you comment and/or update the issue there to reflect where we are at on the question?

@nicola
Copy link
Contributor Author

nicola commented Sep 15, 2018

This does not resolve #157 this is one strategy to investigate and step number 1 for both aggregation or recursive composition. We are no further of where we left before, all updates are written on github

@porcuquine
Copy link
Collaborator

Got it. Thanks.

@lucaniz
Copy link

lucaniz commented Sep 21, 2018

Hi all,

just talked with Matteo who I knew had to deal with Snarks composition [and then with the problems of sampling the different curves].

He told me he actually did not do it in the end, but talking with Rihad he was pointed to this paper:
https://www.shiftleft.org/papers/decaf/decaf.pdf

@nicola
Copy link
Contributor Author

nicola commented Sep 21, 2018

Adding another pointer here, Dario Fiore at IMDEA mentioned Geppetto

@nicola
Copy link
Contributor Author

nicola commented Sep 21, 2018

technical name for this in geppetto is: bounded proof bootstrapping

@nicola
Copy link
Contributor Author

nicola commented Sep 22, 2018

Cocks-Pinch method is the one we should use to find the right curve. Luckily Scippr-lab has an implementation here: https://github.com/scipr-lab/ecfactory/tree/master/ecfactory/cocks_pinch

@nicola
Copy link
Contributor Author

nicola commented Sep 22, 2018

I am a bit unclear on what the inputs to the Cocks-Pinch algorithm should be:

  • k = embedding degree = 12? (from zcash blog)
  • do we want the group order of the second curve to be the prime q=4002409555221667393417789825735904156556882819939007885332058136124031650490837864442687629129015664037894272559787 ?

@nicola nicola closed this as completed Sep 22, 2018
@nicola nicola reopened this Sep 22, 2018
@nicola
Copy link
Contributor Author

nicola commented Oct 8, 2018

Zcash is thinking about his too! zcash/zcash#3425 (comment)

@nicola
Copy link
Contributor Author

nicola commented Oct 11, 2018

r = 52435875175126190479447740508185965837690552500527637822603658699938581184513

@nicola nicola changed the title Aggregating challenges with SNARKs Discussing Geppetto solution to aggregate challenges Oct 11, 2018
@dignifiedquire
Copy link
Contributor

closing this, @nicola please open in a research repo if this still needs work

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants