News for hackers. Stuff that matters.

A comment on Zero knowledge proofs in RISC-V.

Re:Zero knowledge proofs in RISC-V by tromp on Friday May 06, 2022 @03:34AM (#31282396)
This looks like an extension of the older TinyRAM model [1] to a real ISA. From the Abstract:

We present an implementation of a publicly-verifiable non-interactive argument system for NP. The system, moreover, is a zero-knowledge proof-of-knowledge. It directly proves correct executions of programs on TinyRAM, a random-access machine tailored for efficient verification of nondeterministic computations.

[1] https://eprint.iacr.org/2013/507.pdf

[ Parent | on HN ]
Re:Zero knowledge proofs in RISC-V by jeremy_bruestle on Saturday May 07, 2022 @10:39AM (#31294858)
It is similar, although rather than using a Benes net to implement the permutation, it uses PLONK (https://eprint.iacr.org/2019/953.pdf), which is massively more efficient. And of course it actually implements the RISC-V ISA which makes it more useful in practice.
[ Parent | on HN ]