Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
124 changes: 124 additions & 0 deletions papers/pcp-exposition/generated/lean.json
Original file line number Diff line number Diff line change
@@ -1,17 +1,21 @@
{
"modules": [
"PCP.Algebraic.BLR",
"PCP.Algebraic.BinaryLocalCorrection",
"PCP.Algebraic.BinaryLocalCorrectionSoundness",
"PCP.Algebraic.BinaryZeroOnGridSoundness",
"PCP.Algebraic.EncodedLineLowDegreeSoundness",
"PCP.Algebraic.EncodedLineLowDegreeTest",
"PCP.Algebraic.GeneratorLowDegreeTest",
"PCP.Algebraic.GridVanishing",
"PCP.Algebraic.Hadamard",
"PCP.Algebraic.HadamardSoundness",
"PCP.Algebraic.HadamardTest",
"PCP.Algebraic.PointLineSoundness",
"PCP.Algebraic.SetMultilinear",
"PCP.Algebraic.ThreeColorAmplifiedVerifier",
"PCP.Algebraic.ThreeColorGrid",
"PCP.Algebraic.ThreeColorVerifier",
"PCP.Algebraic.ThreeColorVerifierCompleteness",
"PCP.Algebraic.ThreeColorVerifierSoundness",
"PCP.Complexity.CostModel",
Expand Down Expand Up @@ -7498,6 +7502,126 @@
"type": "SOURCE EXCERPT, NOT ELABORATED:\ntheorem orGate_iff (z x y : Literal W) (a : W → Bool) :\n (∀ j, ClauseHolds (orGate z x y j) a) ↔ z.eval a = (x.eval a || y.eval a)",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 64,
"is_class": false,
"kind": "def",
"line": 63,
"module": "PCP.Algebraic.SetMultilinear",
"name": "PCP.Algebraic.SetMultilinear.evaluationPoint",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\ndef evaluationPoint (x : R) : Variables m c → R :=\n fun ij => x ^ ((ij.2 : ℕ) * m ^ (ij.1 : ℕ))",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 107,
"is_class": false,
"kind": "theorem",
"line": 101,
"module": "PCP.Algebraic.SetMultilinear",
"name": "PCP.Algebraic.SetMultilinear.eval_encode",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\ntheorem eval_encode (P : Polynomial R) (hP : P.natDegree < m ^ c) (x : R) :\n MvPolynomial.eval (evaluationPoint m c x) (encode m c P) = P.eval x",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 32,
"is_class": false,
"kind": "abbrev",
"line": 32,
"module": "PCP.Algebraic.EncodedLineLowDegreeTest",
"name": "PCP.Algebraic.EncodedLineLowDegreeTest.Auxiliary",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\nabbrev Auxiliary (F σ : Type*) (m c t : ℕ) := Lines F σ → RowOracle F m c t",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 45,
"is_class": false,
"kind": "structure",
"line": 37,
"module": "PCP.Algebraic.ThreeColorVerifier",
"name": "PCP.Algebraic.ThreeColorVerifier.Proof",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\nstructure Proof (F : Type*) (n m c t : ℕ) where\n color : Vertex F n → Coefficients t 3 → ZMod 2\n validCert : PairPoint F n → Coefficients t 1 → ZMod 2\n difference : PairPoint F n → Coefficients t 3 → ZMod 2\n properCert : ProperPoint F n → Coefficients t 1 → ZMod 2\n colorLines : EncodedLineLowDegreeTest.Auxiliary F (Fin n) m c t\n validLines : EncodedLineLowDegreeTest.Auxiliary F (Fin n ⊕ Fin n) m c t\n differenceLines : EncodedLineLowDegreeTest.Auxiliary F (Fin n ⊕ Fin n) m c t\n properLines : EncodedLineLowDegreeTest.Auxiliary F (Fin (n + n) ⊕ Fin (n + n)) m c t",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 136,
"is_class": false,
"kind": "inductive",
"line": 124,
"module": "PCP.Algebraic.ThreeColorVerifier",
"name": "PCP.Algebraic.ThreeColorVerifier.Query",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\ninductive Query (F : Type*) (n m c t : ℕ) where\n | color : Vertex F n → Coefficients t 3 → Query F n m c t\n | validCert : PairPoint F n → Coefficients t 1 → Query F n m c t\n | difference : PairPoint F n → Coefficients t 3 → Query F n m c t\n | properCert : ProperPoint F n → Coefficients t 1 → Query F n m c t\n | colorLine : (Vertex F n × Vertex F n) → BinaryLocalCorrection.InnerPoint F m c →\n Coefficients t 1 → Query F n m c t\n | validLine : (PairPoint F n × PairPoint F n) → BinaryLocalCorrection.InnerPoint F m c →\n Coefficients t 1 → Query F n m c t\n | differenceLine : (PairPoint F n × PairPoint F n) → BinaryLocalCorrection.InnerPoint F m c →\n Coefficients t 1 → Query F n m c t\n | properLine : (ProperPoint F n × ProperPoint F n) → BinaryLocalCorrection.InnerPoint F m c →\n Coefficients t 1 → Query F n m c t",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 147,
"is_class": false,
"kind": "def",
"line": 139,
"module": "PCP.Algebraic.ThreeColorVerifier",
"name": "PCP.Algebraic.ThreeColorVerifier.read",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\ndef read (π : Proof F n m c t) : Query F n m c t → ZMod 2\n | .color x q => π.color x q\n | .validCert x q => π.validCert x q\n | .difference x q => π.difference x q\n | .properCert x q => π.properCert x q\n | .colorLine uv x q => π.colorLines uv x q\n | .validLine uv x q => π.validLines uv x q\n | .differenceLine uv x q => π.differenceLines uv x q\n | .properLine uv x q => π.properLines uv x q",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 59,
"is_class": false,
"kind": "def",
"line": 45,
"module": "PCP.Algebraic.BinaryLocalCorrection",
"name": "PCP.Algebraic.BinaryLocalCorrection.run",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\nnoncomputable def run (ρ : F ≃ₗ[ZMod 2] (Fin t → ZMod 2))\n (nodes : Fin (c + 1) → F) (ζ : F)\n (f : (σ → F) → Coefficients t 1 → ZMod 2)\n (H : (σ → F) → RowOracle F m c t) (a b : σ → F) (z : Fˣ)\n (v : InnerPoint F m c) (w : Fin t → ZMod 2) (s : InnerSeed F m c t) :\n Option (ZMod 2) := by",
"type_dependencies": [],
"value_dependencies": []
},
{
"axioms": [],
"doc": null,
"end_line": 151,
"is_class": false,
"kind": "theorem",
"line": 149,
"module": "PCP.Algebraic.SetMultilinear",
"name": "PCP.Algebraic.SetMultilinear.totalDegree_encode_le",
"provenance": "source-read",
"structural_dependencies": [],
"type": "SOURCE EXCERPT, NOT ELABORATED:\ntheorem totalDegree_encode_le (P : Polynomial R) :\n (encode m c P).totalDegree ≤ c",
"type_dependencies": [],
"value_dependencies": []
}
]
}
83 changes: 72 additions & 11 deletions papers/pcp-exposition/links.json
Original file line number Diff line number Diff line change
Expand Up @@ -181,13 +181,13 @@
"id": "pcp-expository-grid-certificate",
"section": "5",
"role": "explains",
"quote": "The displayed decomposition certifies the grid condition: each term\ncontains a factor that vanishes on the grid. In more variables, the\ncorresponding statement is Lemma 2.9 of the [corrected paper][paper-v2]:\na polynomial vanishing on $H^m$ can be written",
"quote": "Each summand vanishes on the grid because it contains one of its\ncoordinate vanishing polynomials. Polynomial division in each\nvariable proves this result. After removing all multiples of the\n$Z_H(X_j)$, the remainder has degree less than $|H|$ in every variable;\nif it is zero on the whole grid, repeated univariate interpolation makes\nthe remainder zero. Write $h=|H|\\geq1$. Division can choose each nonzero\nquotient with $\\deg Q_j+h\\leq\\deg P$: removing a multiple of the monic\ndegree-$h$ polynomial loses $h$ from its total degree.",
"lean": [
"PCP.Algebraic.GridVanishing.vanishesOn_iff_exists_decomposition"
],
"anchor": {
"heading": "5. A certificate for vanishing on a grid",
"block": 5
"block": 3
}
},
{
Expand Down Expand Up @@ -239,7 +239,7 @@
],
"anchor": {
"heading": "Why the construction needs more than linear questions",
"block": 12
"block": 13
}
},
{
Expand All @@ -252,7 +252,7 @@
],
"anchor": {
"heading": "8. Combining the encodings and returning to the grid",
"block": 11
"block": 8
}
},
{
Expand All @@ -278,14 +278,14 @@
],
"anchor": {
"heading": "10. Randomness, proof length and repetition",
"block": 11
"block": 5
}
},
{
"id": "linked-source-14",
"section": "9. From the seven checks to a colouring",
"role": "explains",
"quote": "For perfect completeness, start with a proper colouring, interpolate it,\nform its difference polynomial, and construct the two vanishing\ncertificates. Supply their honest encodings and line tables.\nInterpolation identities, binary encoding identities and the two grid\ncertificates then make every check accept for every seed, provided the\nhonest degrees fit the encoding capacity. Section 10 checks the\nsufficient condition $5m(h-1)<b^c$ for the chosen parameters.",
"quote": "For perfect completeness, start with a proper colouring, interpolate it,\nform its difference polynomial, and construct the two vanishing\ncertificates. Supply their honest encodings and line tables.\nInterpolation identities, binary encoding identities and the two grid\ncertificates then make every check accept for every seed, provided the\nhonest degrees fit the encoding capacity.",
"lean": [
"PCP.Algebraic.ThreeColorVerifier.exists_proof_rejectionRate_eq_zero"
],
Expand All @@ -304,7 +304,7 @@
],
"anchor": {
"heading": "8. Combining the encodings and returning to the grid",
"block": 28
"block": 26
}
},
{
Expand Down Expand Up @@ -337,13 +337,13 @@
"id": "linked-source-19",
"section": "10. Randomness, proof length and repetition",
"role": "explains",
"quote": "These bounds establish independence from the input size; they do\nnot give a practical verification protocol. The formal construction\nrepeats the verifier $R=1137847282503168$ times with independent\nrandom seeds, accepting only when every run accepts.",
"quote": "For the implemented verifier the retained arithmetic gives\n$\\gamma=1/1137847282503168$ after fair-bit sampling. The fixed repetition\ncount $R=1137847282503168$ satisfies $R\\gamma=1$. These are existence\nbounds, not practical estimates.",
"lean": [
"PCP.Algebraic.ThreeColorAmplifiedVerifier.verification_guarantees"
],
"anchor": {
"heading": "10. Randomness, proof length and repetition",
"block": 14
"heading": "Parameter calculation",
"block": 9
}
},
{
Expand Down Expand Up @@ -384,6 +384,59 @@
"block": 4
},
"section": "Optional calculation: converting a finite relation to clauses"
},
{
"id": "pcp-expository-proof-table-type",
"section": "The stored proof",
"role": "explains",
"quote": "The prover supplies four primary tables and four auxiliary line tables.",
"lean": [
"PCP.Algebraic.ThreeColorVerifier.Proof"
],
"anchor": {
"heading": "The stored proof",
"block": 1
}
},
{
"id": "pcp-expository-digit-substitution",
"section": "6",
"role": "explains",
"quote": "Every coordinate with $j=0$ is one, including at $z=0$.",
"lean": [
"PCP.Algebraic.SetMultilinear.evaluationPoint"
],
"anchor": {
"heading": "6. Keeping the number of queries constant",
"block": 14
}
},
{
"id": "pcp-expository-digit-evaluation",
"section": "6",
"role": "explains",
"quote": "In general, write an exponent $j<b^c$ with $c$ base-$b$ digits and\nreplace $Y^j$ by the product of the corresponding $c$ variables.\nThe resulting polynomial has degree at most $c$, and the same\nsubstitution recovers every evaluation of the original polynomial.",
"lean": [
"PCP.Algebraic.SetMultilinear.totalDegree_encode_le",
"PCP.Algebraic.SetMultilinear.eval_encode"
],
"anchor": {
"heading": "6. Keeping the number of queries constant",
"block": 12
}
},
{
"id": "pcp-expository-worked-correction-source",
"section": "Following the one-edge certificate to bits",
"role": "uses",
"quote": "Within each call, comparison and return reuse its inner direction.",
"lean": [
"PCP.Algebraic.BinaryLocalCorrection.run"
],
"anchor": {
"heading": "Following the one-edge certificate to bits",
"block": 12
}
}
],
"plain": {
Expand Down Expand Up @@ -433,7 +486,15 @@
"PCP.Algebraic.Hadamard.linearEncode": "Homogeneous linear encoding",
"PCP.Algebraic.Hadamard.relativeDistance_linearEncode": "Homogeneous words differ by half",
"PCP.Reduction.FiniteBooleanConstraints.clauses": "Clauses for a finite relation",
"PCP.Reduction.FiniteBooleanConstraints.orGate_iff": "Three clauses enforce one OR gate"
"PCP.Reduction.FiniteBooleanConstraints.orGate_iff": "Three clauses enforce one OR gate",
"PCP.Algebraic.SetMultilinear.evaluationPoint": "Digit-substitution point",
"PCP.Algebraic.SetMultilinear.eval_encode": "Evaluation after digit encoding",
"PCP.Algebraic.EncodedLineLowDegreeTest.Auxiliary": "Encoded line-table type",
"PCP.Algebraic.ThreeColorVerifier.Proof": "The eight proof tables",
"PCP.Algebraic.ThreeColorVerifier.Query": "Eight physical query tags",
"PCP.Algebraic.ThreeColorVerifier.read": "Read a tagged proof bit",
"PCP.Algebraic.BinaryLocalCorrection.run": "Run outer local correction",
"PCP.Algebraic.SetMultilinear.totalDegree_encode_le": "Constant digit-encoding degree"
},
"fidelity_held": "The selected source has not yet been compared against elaborated Lean statements for this page."
}
Loading