Puzzle V2 • ZK Hack V (Nov 26th to Dec 17th)

Small fields have been all the rage for increasing performance on SNARKs. We should use them everywhere, also in lookup arguments! Or should we?

View the solution

Puzzle Preparation

To give you a better chance of solving this puzzle, we suggest that you look through some relevant background materials.

See puzzle details on Github

Puzzle link

Puzzle Hints

Hint #1

What can we do to the witness to satisfy the assert at line 154 of protocol.rs? What if the witness is very long?

Hint #2

Watch S2M3 of the ZK Whiteboard Sessions. Are all the conditions met to safely run the LogUp protocol?

Hint #3

We are working with the extension of a prime field, with p=70937. What happens when we add something to itself 70937 times? Try writing a test that does this if you are not sure.

Puzzle Winners

01

Zellic

Puzzle completed

Score

1,000

02

DamianStraszak

Puzzle completed

Score

999.7

03

Konstantce

Puzzle completed

Score

997.5

You can see all of the scores for this puzzle in the spreadsheet here.

Puzzle Solutions and Write-ups

The winner of the puzzle write-up was submitted by niooss-ledger. You can view the solution and puzzle write-up here. The background material required to solve the puzzle is also covered in the write up.
There were many interesting write-up submissions which are linked below:
* Winning write-up by niooss-ledger
* Write-up by reymom
* Write-up by lopeetall
* Write-up by lukaszt-pcs
* Write-up by 0x6980
* Write-up by fluffypill0w
* Write-up by huy-tn
* Write-up by simonmasson
* Write-up by kkstar0