ZK HACK - Puzzle 4

Sometimes you can say too much.

Puzzle Preparation

To give you a better chance of solving this puzzle, we suggest that you look through some relevant background materials. For this particular puzzle, the topic of KZG polynomial commitments will be key.

See puzzle details on Github

Puzzle Preparation

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Molestie vel vulputate diam condimentum tristique est. Eget gravida sagittis, mi donec est. Amet turpis leo morbi enim nulla lorem sed justo. Tincidunt eu diam pellentesque nibh blandit viverra. Tincidunt pellentesque ultrices ac, sed quis purus ac. Orci adipiscing sapien aenean tincidunt rutrum. Molestie in tortor risus est.Lorem ipsum dolor sit amet, consectetur adipiscing elit. Molestie vel vulputate diam condimentum tristique est. Eget gravida sagittis, mi donec est. Amet turpis leo morbi enim nulla lorem sed justo. Tincidunt eu diam pellentesque nibh blandit viverra. Tincidunt pellentesque ultrices ac, sed quis purus ac. Orci adipiscing sapien aenean tincidunt rutrum. Molestie in tortor .

Puzzle Hints

This puzzle is based on elements of Rounds 1, 2 and 4 in Section 8.3 of the Plonk paper. Research the distinction between computational hiding and unconditional hiding. Here is a resource that discusses the two in the context of Pedersen commitments. Create a system of two equations with two unknowns.

Puzzle Winners

01

wborgeaud

Puzzle completed

Score

1000

02

shamatar

Puzzle completed

Score

999.0

03

Rumata888

Puzzle completed

Score

994.7

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

Puzzle Solutions

The winner of the puzzle write up was submitted by the team tom marvolo riddel, which you can view here. There were many excellent puzzle write ups submitted, you can view them directly here:

* Solution by TrapdoorTech
* Solution by niooss-ledger
* Solution by negativeknowledge
* Solution by Michael-Qedit
* Solution by grjte