Browser-based Nova NIFS lab — watch a plain random combination of two satisfying R1CS instances fail, then watch E' = E₁ + rT + r²E₂ restore it, with real ristretto255 commitments, tampering fixtures, and no zero-knowledge claimed.
cryptography nova r1cs zero-knowledge-proofs ristretto255 crypto-lab folding-schemes incrementally-verifiable-computation
-
Updated
Oct 16, 2026 - TypeScript