acceleration-program
acceleration-program copied to clipboard
Nova by hand
Open Task RFP for Nova by hand
Executive Summary
- Project Overview: Provide an implementation/tutorial for individuals to self-construct Nova, and related topics.
Project Details
- Scope of Work: Follow similar approach as tutorial work based on Plonkathonto implement Nova and its tutorial - Folding Schemes(Relaxed R1CS) - Spartan(Sumcheck)
- Expected Outcomes: Clearly state what successful completion of the project looks like.
- Technical Requirements: Python
Qualifications
- Skills Required: Understanding protocol and be able to implement with Python
- Preferred Qualifications: Prior knowledge in cryptography including commitment scheme, IOP, etc.
Administrative Details
- Grant Liaison(s): @NOOMA-42, [email protected]
- Estimated Project Duration: Ideally 1.5 months
- Project Complexity: Easy
Additional Information
- Relevant Tags: ZKP
- Reference Material: https://github.com/0xPARC/plonkathon https://research.metastate.dev/plonk-by-hand-part-1/ https://github.com/privacy-scaling-explorations/folding-schemes https://github.com/nalinbhardwaj/Nova-Scotia
Submission Details
- Proposal Deadline: The deadline for submitting proposals is the end of this round of the Acceleration Program. Refer to current round
- Submission Instructions: Please submit your proposal as an issue and link back to this issue in your proposal. Refer to proposal template for more details.
I am really interested in nova by hand, how can i deal with this project?
Hi @FoodChain1028 Glad to hear your interest, kindly send out your proposal as issue per the template.
Hello. I also want to conduct this, Nova by hand. May I still send you my proposal in two weeks?
Hello. I also want to conduct this, Nova by hand. May I still send you my proposal in two weeks?
Yes please send your proposal
@NOOMA-42
I think Nova consists of Folding Schemes(Relaxed R1CS) and Spartan(Sumcheck). However, for me, it will be so challenging to implement Spartan. Can I focus on Nova's Folding Schemes(Relaxed R1CS) first?
@NOOMA-42 I think Nova consists of
Folding Schemes(Relaxed R1CS)andSpartan(Sumcheck). However, for me, it will be so challenging to implement Spartan. Can I focus on Nova'sFolding Schemes(Relaxed R1CS)first?
yes you can, then please specify this specific scope in proposal
I did some indepth research about that including folding scheme/snark backend/cycle curves/..., few months ago posted on Chinese web side learningblockchain.com
we are planing to implement a plonkish nova forwarding to a protostar style plus some modern lookup arguments, a lot of work to do and plenty of details to discuss, from proving system to cycle curves, etc...
So welcome to join us and crack it! If you guys are interested @yugocabrio @FoodChain1028 @NOOMA-42 you can reach out to me through wechat ID paynejoe.
Hi @PayneJoe glad to hear that, Is your implementation going to target production level or prototype level?
Hi @PayneJoe glad to hear that, Is your implementation going to target production level or prototype level?
R1CS based nova is what you called prototype level in most circumstances, since no customized gate/lookup argument supported. So a plonkish one will be more close to production. And this is what most teams are doing, as far as I know.
But a few stages have to be accomplished, and tough works to be done...
completed
Looking for a Nova by Hand explainer, but so far all I'm finding is this issue. Did Nova by Hand get created?
@pdg744 Hello, I made these articles! https://github.com/privacy-scaling-explorations/nova-by-hand