Dataset Viewer
Auto-converted to Parquet Duplicate
task_id
stringlengths
21
23
challenge_id
stringlengths
16
16
proof_assistant
stringclasses
1 value
session
stringclasses
1 value
repo
stringclasses
57 values
revision
stringclasses
57 values
file_path
stringlengths
13
92
theory
stringlengths
1
48
variant
int64
0
132
challenge_type
stringclasses
1 value
difficulty
null
count
null
by_centrality
bool
1 class
ablation_prob
float64
0.5
0.5
min_depth
int64
1
1
max_depth
int64
1
1
leaves_only
bool
1 class
min_size
int64
0
0
max_size
stringclasses
1 value
min_centrality
int64
0
0
max_centrality
stringclasses
1 value
seed
int64
42
42
n_proofs
int64
1
173
n_ablated
int64
1
60
holes_filled
listlengths
1
60
deleted_lemmas
listlengths
1
1
corollaries
listlengths
1
1
closure_size
int64
1
172
challenge_file_content
stringlengths
133
350k
solution_file_content
stringlengths
394
351k
solution_diff
stringlengths
243
134k
manifest
dict
ablate_9f470b8a1f5e_0
1dfed12c3611bbe2
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/OracleReduction/Security/TranscriptTree/Composition.lean
Composition
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
1
[ { "theorem_name": "transcript_msg", "depth": 1, "n_commands": 0, "n_lines": 3, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n conv_lhs => rw [peelMsg_spec path]\n rfl", "n_chars": 46, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1...
[ { "name": "peelMsg_spec", "text": "/-- A `LeafPath` at a message node is `.msg` of its peel. -/\ntheorem peelMsg_spec {k : Fin m} {h : pSpec₁.dir k = .P_to_V} {msg : pSpec₁.Message ⟨k, h⟩}\n {child : ChallengeTree pSpec₁ arity₁ k.succ} (p : LeafPath (.msgNode k h msg child)) :\n p = @LeafPath.msg _ _ ...
[ { "name": "transcript_msg", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 9, "n_chars": 452, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_nesting"...
1
/- Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Tobias Rothmann -/ import ArkLib.OracleReduction.Security.TranscriptTree.Basic /-! # Trees of transcripts — sequential composition This file relates trees of transcrip...
/- Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Tobias Rothmann -/ import ArkLib.OracleReduction.Security.TranscriptTree.Basic /-! # Trees of transcripts — sequential composition This file relates trees of transcrip...
@@ -361,6 +361,11 @@ {child : ChallengeTree pSpec₁ arity₁ k.succ} (p : LeafPath (.msgNode k h msg child)) : LeafPath child := (peelMsgAux p).1 +/-- A `LeafPath` at a message node is `.msg` of its peel. -/ +theorem peelMsg_spec {k : Fin m} {h : pSpec₁.dir k = .P_to_V} {msg : pSpec₁.Message ⟨k, h⟩} + {chil...
{ "repo": "ArkLib", "git_repo": "github.com/Verified-zkEVM/ArkLib", "revision": "5a83bfb4383503d70d7b5a05355d396855b3151b", "lean_toolchain": "leanprover/lean4:v4.30.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-delete-l...
ablate_9f470b8a1f5e_1
139b3ca85597e72b
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/OracleReduction/Security/TranscriptTree/Composition.lean
Composition
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
1
[{"theorem_name":"transcript_chal","depth":1,"n_commands":0,"n_lines":3,"is_leaf":true,"centrality":(...TRUNCATED)
[{"name":"chalPeel_spec","text":"/-- A `LeafPath` at a challenge node is `.chal` of its peeled index(...TRUNCATED)
[{"name":"transcript_chal","fan_in":0,"n_deps_direct":1,"n_deps_transitive":1,"n_lines":11,"n_chars"(...TRUNCATED)
1
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"@@ -402,6 +402,14 @@\n (p : LeafPath (.chalNode k h challenges children)) :\n (j : Fin (ari(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_9f470b8a1f5e_2
ddc2b165f7e611a9
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/OracleReduction/Security/TranscriptTree/Composition.lean
Composition
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
3
[{"theorem_name":"appendSplit_fst_isStructured","depth":1,"n_commands":0,"n_lines":3,"is_leaf":true,(...TRUNCATED)
[{"name":"splitDataOfTree_src","text":"/-- The `SplitData` certificate built from an appended tree f(...TRUNCATED)
[{"name":"appendSplit_fst_isStructured","fan_in":0,"n_deps_direct":2,"n_deps_transitive":2,"n_lines"(...TRUNCATED)
2
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"@@ -547,6 +547,12 @@\n (T : ChallengeTree (pSpec₁ ++ₚ pSpec₂) (appendArity arity₁ arity(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_9f470b8a1f5e_3
c3e83c6374cf9315
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/OracleReduction/Security/TranscriptTree/Composition.lean
Composition
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
3
[{"theorem_name":"appendSplit_fst_isStructured","depth":1,"n_commands":0,"n_lines":3,"is_leaf":true,(...TRUNCATED)
[{"name":"splitDataOfTree_src","text":"/-- The `SplitData` certificate built from an appended tree f(...TRUNCATED)
[{"name":"appendSplit_sndAt_isStructured","fan_in":0,"n_deps_direct":1,"n_deps_transitive":1,"n_line(...TRUNCATED)
1
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"@@ -547,6 +547,12 @@\n (T : ChallengeTree (pSpec₁ ++ₚ pSpec₂) (appendArity arity₁ arity(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_9f470b8a1f5e_4
8097e270c822462b
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/OracleReduction/Security/TranscriptTree/Composition.lean
Composition
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
1
[{"theorem_name":"rightPrefix_concat","depth":1,"n_commands":0,"n_lines":17,"is_leaf":true,"centrali(...TRUNCATED)
[{"name":"cast_eq_cast_of_heq","text":"/-- Two casts into a common type are equal as soon as their a(...TRUNCATED)
[{"name":"rightPrefix_concat","fan_in":1,"n_deps_direct":1,"n_deps_transitive":1,"n_lines":28,"n_cha(...TRUNCATED)
1
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"@@ -715,6 +715,12 @@\n Fin.val_castAdd, Fin.val_succ] <;>\n exact cast_eq_iff_heq.mpr (ca(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_9f470b8a1f5e_5
89954bf2ed9d8c81
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/OracleReduction/Security/TranscriptTree/Composition.lean
Composition
5
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
3
[{"theorem_name":"appendSplit_fst_isStructured","depth":1,"n_commands":0,"n_lines":3,"is_leaf":true,(...TRUNCATED)
[{"name":"splitDataOfTree_src","text":"/-- The `SplitData` certificate built from an appended tree f(...TRUNCATED)
[{"name":"appendSplit_fullTranscripts_append_of_mem","fan_in":0,"n_deps_direct":1,"n_deps_transitive(...TRUNCATED)
1
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"/-\nCopyright (c) 2024-2025 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 li(...TRUNCATED)
"@@ -547,6 +547,12 @@\n (T : ChallengeTree (pSpec₁ ++ₚ pSpec₂) (appendArity arity₁ arity(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_4fd2cbfff6a2_0
2926205ea720ef51
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/Data/CodingTheory/ReedSolomon.lean
ReedSolomon
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
10
1
[{"theorem_name":"evalOnPoints_mul","depth":1,"n_commands":0,"n_lines":2,"is_leaf":true,"centrality"(...TRUNCATED)
[{"name":"evalOnPointsRingHom_eq_evalOnPoints","text":"lemma evalOnPointsRingHom_eq_evalOnPoints [Co(...TRUNCATED)
[{"name":"evalOnPoints_mul","fan_in":0,"n_deps_direct":1,"n_deps_transitive":1,"n_lines":6,"n_chars"(...TRUNCATED)
1
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"@@ -49,9 +49,13 @@\n map_add' := by aesop\n map_mul' := by aesop\n \n+lemma evalOnPointsRingH(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_4fd2cbfff6a2_1
1dde47fbbc5f1a63
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/Data/CodingTheory/ReedSolomon.lean
ReedSolomon
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
10
1
[{"theorem_name":"mem_code_of_polynomial_of_natDegree_lt_of_eval","depth":1,"n_commands":0,"n_lines"(...TRUNCATED)
[{"name":"mem_code_of_polynomial_of_degree_lt_of_eval","text":"lemma mem_code_of_polynomial_of_degre(...TRUNCATED)
[{"name":"mem_code_of_polynomial_of_natDegree_lt_of_eval","fan_in":0,"n_deps_direct":1,"n_deps_trans(...TRUNCATED)
1
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"@@ -151,6 +151,15 @@\n \n variable [Semiring F]\n \n+lemma mem_code_of_polynomial_of_degree_lt_of_e(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_4fd2cbfff6a2_2
eb6f8c3aeb465dc3
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/Data/CodingTheory/ReedSolomon.lean
ReedSolomon
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
10
1
[{"theorem_name":"dim_eq_deg_of_le","depth":1,"n_commands":0,"n_lines":5,"is_leaf":true,"centrality"(...TRUNCATED)
[{"name":"genMatIsVandermonde","text":"/-- The Vandermonde matrix is the generator matrix for an RS (...TRUNCATED)
[{"name":"dim_eq_deg_of_le","fan_in":1,"n_deps_direct":1,"n_deps_transitive":2,"n_lines":9,"n_chars"(...TRUNCATED)
1
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"@@ -128,6 +128,25 @@\n \n open LinearCode\n \n+/-- The Vandermonde matrix is the generator matrix f(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
ablate_4fd2cbfff6a2_3
fba3762f486a1d9c
lean
lean
github.com/Verified-zkEVM/ArkLib
5a83bfb4383503d70d7b5a05355d396855b3151b
ArkLib/Data/CodingTheory/ReedSolomon.lean
ReedSolomon
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
10
5
[{"theorem_name":"dim_eq_card_of_lt","depth":1,"n_commands":0,"n_lines":24,"is_leaf":true,"centralit(...TRUNCATED)
[{"name":"dim_eq_deg_of_le'","text":"/-- Generalized dimension formula for RS code with arbitrary fi(...TRUNCATED)
[{"name":"dim_eq_card_of_lt","fan_in":1,"n_deps_direct":2,"n_deps_transitive":3,"n_lines":30,"n_char(...TRUNCATED)
2
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"/-\nCopyright (c) 2024 ArkLib Contributors. All rights reserved.\nReleased under Apache 2.0 license(...TRUNCATED)
"@@ -190,11 +190,89 @@\n ← genMatIsVandermonde, ← rank_eq_dim_fromColGenMat, Vandermonde.(...TRUNCATED)
{"repo":"ArkLib","git_repo":"github.com/Verified-zkEVM/ArkLib","revision":"5a83bfb4383503d70d7b5a053(...TRUNCATED)
End of preview. Expand in Data Studio

Lean Proof-Ablation Eval

Syntactic proof-ablation challenges from 57 real Lean 4 repositories (compilers, cryptography, distributed protocols, zk circuits, program logics — see the repo list below). Each record is a (challenge, solution) pair: the challenge is a real source file with one or more lemmas deleted and their in-file users holed (sorry); the solution is the original file. A solver must re-derive the deleted lemma(s) and close the holes so the file compiles.

Every record is compile-validated: the challenge compiles with its holes AND the ground-truth solution compiles hole-free, against the repo's own built .olean closure at the pinned revision. Records whose challenge does not compile (malformed) or whose ground truth already contained a sorry/axiom (sol_bad) are excluded — only confirmed records ship here.

Splits

Both splits pick the same anchor theorems (the "corollary") and delete the same lemmas from its transitive in-file dependency closure (same seed, 42); they differ only in how the users of a deleted lemma are holed:

split mode what gets holed rows repos
easy corollary-leaves only the leaf tactic steps citing the deleted lemma; the rest of each user's proof survives 21,692 57
hard corollary-whole each user's entire proof body — solve from the statement alone 21,718 57

Ablator flags: --corollary-delete-lemmas-leaves-all (easy) / --corollary-delete-lemmas-all (hard), both with --shrink-solution-minimal --seed 42.

Row schema

Uniform across both splits (missing values are explicit nulls):

  • Task identity: task_id, challenge_id (stable join key), repo, revision, file_path, theory, proof_assistant, session, variant
  • The challenge: challenge_file_content (the file with deletions + holes), solution_file_content (ground truth), solution_diff
  • Ablation parameters: challenge_type, ablation_prob, seed, leaves_only, depth/size/centrality bounds, n_proofs, n_ablated, closure_size
  • Proof-complexity features (computed by the ablator's parser, per item): holes_filled[] (each holed user: proof_text, n_tactics, cyclomatic, n_automation, max_nesting, …), deleted_lemmas[] (each deleted lemma: text, fan_in, …), corollaries[] (the anchor theorem: n_deps_direct, n_deps_transitive, …)
  • manifest: the provenance record of the per-repo ablation run this row came from — git_repo, revision, lean_toolchain, ablator, ablator_flags, seed, validation, and counts (mined_total/good_kept/well_formed/malformed/sol_bad; the last two are 0 when no record was rejected for that reason). All rows of one repo in one split share a manifest.

Loading

from datasets import load_dataset

ds = load_dataset("for-all-dev/ablation-eval")
easy, hard = ds["easy"], ds["hard"]

# one repo's worth
ryu = easy.filter(lambda r: r["manifest"]["repo"] == "ryu-lean4")

Scoring a solver

Scoring is real compilation, not string match. The git-history-evals scaffold's ablate-baseline harness (in baselines/) consumes these JSONL files directly: it splices each challenge_file_content into a checkout of the source repo at manifest.revision (built with manifest.lean_toolchain), runs a ReAct agent to close the holes, and PASSes a record only when the finished file compiles hole-free. Repo pins for all 57 sources are in pipeline/repos.tsv; pipeline/clone_repos.sh materialises and builds them.

uv run ablate-baseline easy.jsonl data/lean/<repo> --model <model> [--repo <name>]
# the harness runs the one repo slice matching --repo (default: the src
# directory's name), selected via each row's embedded manifest

Caveat for anyone re-validating

Most apparent malformed challenges in re-runs are an artifact of an incomplete build of the source tree, not of the data: lake build only builds a lakefile's default target, so sibling modules can be left uncompiled and every challenge importing one fails with object file ... does not exist. Build the full closure before trusting a malformed count.

Contamination note

All 57 upstream repos are public OSS and likely present in frontier-model pretraining corpora. The ablations are syntactic and freshly generated (deleted lemmas + holed users at a pinned revision), which makes verbatim recall less useful than for git-history data, but prefer relative comparisons (easy vs hard, across models) over absolute scores.

Attribution & licenses

Each row carries its upstream provenance in manifest.git_repo + manifest.revision. The 57 upstream repositories are distributed under their own licenses (Apache-2.0, MIT, BSD, and others — see each repo); rows redistribute excerpts of upstream source and are bound by the corresponding upstream terms. Use for research/evaluation.

Mining scaffold: for-all-dev/git-history-evals (Forall R&D).

@misc{lean-ablation-eval,
  title  = {Lean Proof-Ablation Eval (57 repos, compile-validated)},
  author = {Dougherty, Quinn and Doty, Matthew},
  year   = {2026},
  howpublished = {\url{https://huggingface.co/datasets/for-all-dev/ablation-eval}},
  note   = {Syntactic corollary-anchored ablations over 57 Lean 4 repositories}
}
Downloads last month
1