microsoft/Nova
View on GitHub ↗ ★ 869 Rust
Nova: High-speed recursive zero-knowledge arguments from folding schemes
4 mentions on Hacker News by 2 people: 0 stories, 4 comments · first 2022-07-06 · latest 2022-12-01
20082026
-
…) for expression evaluation, proving, and verification, with Nova ( https://github.com/microsoft/Nova/ ) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims
comment by jpgross3 · 2022-12-01 · in Ask HN: Who is hiring? (December 2022) -
…) for expression evaluation, proving, and verification, with Nova ( https://github.com/microsoft/Nova/ ) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims
comment by porcuquine · 2022-11-01 · in Ask HN: Who is hiring? (November 2022) -
…) for expression evaluation, proving, and verification, with Nova ( https://github.com/microsoft/Nova/ ) as its proving backend. Because Lurk is Turing-complete, it can be used to make and prove arbitrary computational claims
comment by jpgross3 · 2022-10-03 · in Ask HN: Who is hiring? (October 2022) -
…provides. In theory, we could use Arkworks to implement a backend — but we are targeting Nova ( https://github.com/microsoft/Nova ), and I don't think Arkworks supports Nova currently. So the part we are building from scratch (the language…
comment by porcuquine · 2022-07-06 · in Lurk – Language for Recursive ZK-SNARKs Inspired by Common Lisp and Scheme