The dataset is currently empty. Upload or create new data files. Then, you will be able to explore them in the Dataset Viewer.
pact CTF Corpus
Formally-graded smart-contract CTF challenges, auto-generated and verified by the
pact pipeline.
How challenges are produced
- Seed: a CORRECT, self-contained Solidity 0.8.x contract (token/vault-shaped).
- Mutate: deterministic operator-level mutations (
sol_mutate.py) — no LLM. - Grade: each mutant is checked against a templated conservation/solvency invariant with Halmos (symbolic EVM, BitVec256). A mutant is kept as a CTF iff Halmos produces a concrete counterexample that breaks the invariant.
- Flag: the Halmos counterexample (the input that breaks conservation) is the auto-grading flag — any submitted exploit is verified formally, not against a hardcoded string.
Why this is different
The grader is a proof oracle, not a pattern match. Every challenge ships with a machine-checked witness, and any solve can be verified symbolically. This is the moat beginner CTF platforms (Ethernaut/Secureum-style) lack.
Schema (per record)
| field | meaning |
|---|---|
source_contract |
the correct reference contract |
mutated_src |
the challenge contract (bug hidden) |
mutation |
operator swap + line |
broken_invariant |
which check_* Halmos invariant fails |
witness |
Halmos counterexample = auto-grade flag |
difficulty |
(k, c) = semantic distance × camouflage |
Status
Scaffolding. The offline engine (mutate → Halmos) is sound and produces beginner-tier conservation CTFs; the realism/disguise layer (LLM-camouflaged bugs) is the next lift.
- Downloads last month
- 25