BlocSoc logoBlocSoc IITD
Log in
BlocSoc

BlocSoc IITD presents

Operation Aegis.

A tampered chip, a listener on every wire, and a queue of users that never stops. Build a zero-knowledge prover in silicon that is correct, leaks nothing, and is small.

RequestID_iCommitC = G^rChallengee = H(C, ID)Respondz = r + e·SProof(C, e, z)a new request enters every II cycles · many proofs in flight at once · S never leaves the vault
Submissions close in
--days
:
--hours
:
--min
:
--sec
Deadline · Fri, 16 Oct, 11:59 pm IST
Read the briefOpen playground
7
Submissions
2
Teams on the board
100.0
Top score

Prove it. Leak nothing.

Each request walks through the three moves of a Schnorr proof. Your circuit does all three, in hardware, for every request, while something on the chip is listening.

Step 1

Commit

Draw a fresh nonce and publish a commitment to it. Fresh means fresh: every request gets its own.

Step 2

Challenge

Hash the commitment together with the request's ID. Neither side can choose the challenge.

Step 3

Respond

Combine nonce, challenge and the secret into one number that proves knowledge of S, and reveals nothing else.

Part Aup to 50 pts

Make it work. Make it safe.

Base blocks, one request every 10 cycles. A correct circuit scores; a correct and leak-free one scores far more.

Part B70 – 100 pts

Make it fast.

Unlock MUX, DEMUX and pipelining, and push the request rate up without wasting silicon. Must be leak-free.

Read the full brief →

Leaderboard.

Best submission per participant in each part. Total = the better of the two. Equal totals are ranked by who submitted first. Hover a score for its area, latency and II.

Updated 1:21:54 pm · refreshes every 30 s
#NameSubmission timeP1 · Part AP2 · Part BTotal
1test_2
3 submissions
16 Oct, 03:01 pm11.53insecurePart A · Correct · insecureArea A1,395 GLatency Λ17 cyclesInitiation interval II10 cyclesCost J = A·Λ23,715Throughput1 proof / 10 cyclesSubmitted10 Oct, 06:39 pm100.00Part B · Correct · secureArea A1,585 GLatency Λ17 cyclesInitiation interval II5 cyclesCost J = A^1.5·II·Λ5.364e+6Throughput1 proof / 5 cyclesSubmitted16 Oct, 03:01 pm100.00
2Check-2
4 submissions
16 Oct, 06:48 pm11.53insecurePart A · Correct · insecureArea A1,395 GLatency Λ17 cyclesInitiation interval II10 cyclesCost J = A·Λ23,715Throughput1 proof / 10 cyclesSubmitted16 Oct, 06:47 pm82.43Part B · Correct · secureArea A1,645 GLatency Λ17 cyclesInitiation interval II9 cyclesCost J = A^1.5·II·Λ1.021e+7Throughput1 proof / 9 cyclesSubmitted16 Oct, 06:48 pm82.43