Nova/IVC REPL

Strawman Proposal

• Fork ZKRepl with its existing Circom setup and Monaco integrations (with Circomspect etc.)
• Input format for the REPL
Copy

pragma circom 2.0.3;

// Prove that I know some set of "witness" adders such that starting a
// Fibonacci sequence with some starting public inputs and getting to
// some output public inputs
template Fib () {
    signal input step_in[2];

    signal output step_out[2];

    signal input adder;

    step_out[0] <== step_in[0] + adder;
    step_out[1] <== step_in[0] + step_in[1];
}

component main { public [step_in] } = Fib();

/* INPUT = {
		"starting_step_in": [1, 1],
		"witness": [
			{"adder": 1},
			{"adder": 2},
			{"adder": 1},
		],
} */

• Adds some basic metadata about recursion here (number of steps etc)

• Separate logs by step index, same with output for each step index, and one for final output

• The first step of artifact generation remains the same (but we need the wasm and r1cs only, others optional nice to have)

• Add a check that input length at each step = output length at said step and error in witness gen if so
• Actual proving: buttons to generate output change to “Generate params”, “Prove”, “verify”

1. Internally, these use some WASM compiled package that is quite like the browser-test practically. Minimal 4 functions include:
• Public Param Generation: Generate CRS, return $pk, vk$
• Proving: Run $N$ steps of recursion given starting public input ($z_0$, $W_1, W_2 \dots, W_N$) and returns RecursiveSNARK $proof$ and $z_N$, the output
• Compressing: Input RecursiveSNARK $proof$, output CompressedSNARK $proof$ using Spartan compression
• Verify: Verify CompressedSNARK $proof$
• These will require the WASM/r1cs generated by the previous step to be accessible by the rust runtime. Figure out how to.
‣
Nice to haves
• Verify RecursiveSNARK $proof$ button
• Fix the hover info that’ll break and make it cleanly displayed, maybe in a table or something