Pinned Loading
-
-
ZK Hack 5 Puzzle 2: don't look up
ZK Hack 5 Puzzle 2: don't look up 1Lookup arguments based on logarithmic derivatives are super fast. Protocols that use small fields are super fast. Let's combine both!
23We've implemented a range check for $`[0, 2^6-1]`$ using the special-sound lookup protocol of [ProtoStar](https://eprint.iacr.org/2023/620) (see Section 4.3, p. 34) which itself is a variant of [LogUp](https://eprint.iacr.org/2022/1530). To make this faster, we use a ≈16-bit prime field and take challenges from a larger extension to have roughly 100 bits of security.
45Can you submit a passing proof that $`2^{15}`$ is in the expected range?
-
-
zksecurity/noname
zksecurity/noname PublicNoname: a programming language to write zkapps
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.