argumentcomputer / argumentcomputer/ZKSnark.lean

Formalise Case 2 in the Baby SNARK soundness proof

Open
#8 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
Lean
Stars
8
Forks
2
PR merge metrics
No merged PRs in 30d

Description

The soundness theorem has two subcases depending on whether the constraints hold, see P. 6 by Miller, Zhang and Kanjalkar. Bolton formalised only the first case where all constraints hold everywhere.

The issue is formalise case 2 where some of constraints don't have to be valid somewhere.

Contributor guide

No contributing guide indexed for this repository

Research direction

Start by locating the soundness theorem and reviewing the cited page 6 from Miller, Zhang and Kanjalkar. Formalise the second subcase, where some constraints may be invalid at some points, and confirm that the completed soundness proof checks.

Written by the indexing model from the issue text.

Assessment

Domain
cryptography
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.