Skip to content

Experimental implementation of the SuperNova protocol. https://eprint.iacr.org/2022/1758

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
Notifications You must be signed in to change notification settings

jules/supernova

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SuperNova

Warning: this implementation is experimental and not audited. Please use at your own risk.

GitHub Workflow Status Project license

This repository contains an implementation of the SuperNova protocol, written in Rust. SuperNova is a novel recursive proof system and an extension of the Nova protocol, which introduces folding schemes to circuit arithmetizations, in order to compress multiple executions of the same circuit into one. SuperNova builds on top of this by introducing a VM-like construction where a prover defines circuits separately for each VM instruction, and folds any executed program into the correct circuits, instruction by instruction.

Progress

  • R1CS arithmetization
  • Vanilla Plonk arithmetization
  • Prover/verifier construction
  • Tests

Disclaimer

Nova and SuperNova are research works done by Srinath Setty (GitHub, Twitter) and Abhiram Kothapalli (and Ioanna Tzialla for Nova), and this repository heavily relies on the earlier implementation of Nova. All credit goes to them!

About

Experimental implementation of the SuperNova protocol. https://eprint.iacr.org/2022/1758

Resources

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages