✨Nova Scotia: Middleware to use Circom circuits with Nova prover
Nova is Microsoft’s awesome new preprocessing layer for SNARKs that can greatly compress repeated computation: take N instances of relaxed R1CS and verify it for the cost of ~ a single one.
Conversation
Replying to
With Nova Scotia, you can use circuits written in Circom with just a little bit of extra Rust shim.
Try it out! We have some example circuits (such as btc PoW) where we can compress checking ~18mil constraints down to ~120k in < 60sec on my old laptop
Readme has more details
4
13
Credits to for developing Nova and helping out with Nova Scotia, for circom, and for introducing me to Nova. He also has a great talk on Nova here if you’re curious to understand the internals and its strengths:
1
5
If this flavour of project interests you, 's PARC Squad will also be working on similar ideas and advancements in zkSNARK composition, aggregation and recursion🐻
Applications closing soon!
Quote Tweet
1/ [APPLY BY 11/18] 0xPARC's Proof Aggregation, Recursion and Composition (PARC) Squad is a cross-team, full-stack effort to advance recursion, composition and aggregation capabilities of modern proof systems, and to bring PARC applications to production.
0xparc.org/blog/parc-squad
Show this thread
1
2
10
We've just added full support for in-browser proving and verification to Nova and Nova Scotia: nova-scotia-nalinbhardwaj.vercel.app
Check it out and start building your own recursive zkSNARK apps with full client side support: github.com/nalinbhardwaj/
s/o / Samuel Burnham
4
15
53
2
3
This Tweet was deleted by the Tweet author. Learn more
Replying to
response here:
Quote Tweet
Replying to @zknark
I don’t think so: But (as described in README/video above) IMO Nova is most useful as a pre processor (and then write verifiers for it in other systems like plonk/groth16) since verification is linear in the size of one step circuit and it would be gas prohibitive ootb
2
Show more replies