A SNARK to prove X prime numbers exist below Y

[NOOMA-42]

Open Task RFP for A SNARK to prove X prime numbers exist below Y

Executive Summary

• Project Overview: This project aims to familiarize you with the concept of recursive snark (or IVC) You have to apply the primality test recursively given Y and calculate X. This is more of a project for learning purposes.

Project Details

• Scope of Work: A PoC and blog post
• Expected Outcomes: A PoC and blog post explaining your methodology
• Technical Requirements: Not specific framework

Qualifications

• Skills Required: know snark
• Preferred Qualifications: know recursive SNARK/Folding

Administrative Details

• Grant Liaison(s): TO BE FILLED OUT
• Estimated Project Duration: 100 hr
• Project Complexity: Medium

Additional Information

• Relevant Tags: Recursive SNARK
• Reference Material: Primality test

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.