EvoPoC: Automated Exploit Synthesis for DeFi Smart Contracts via Hierarchical Knowledge Graphs
Ruichao Liang, Jing Chen, Xianglong Li, Huangpeng Gu, Yebo Feng, Yue Xue, Cong Wu, Yang Liu

TL;DR
EvoPoC introduces a knowledge-driven system utilizing hierarchical knowledge graphs and multi-hop reasoning to automate exploit synthesis for DeFi smart contracts, significantly improving vulnerability detection and exploit success rates.
Contribution
The paper presents EvoPoC, a novel structured reasoning framework that combines knowledge graphs and validation techniques to automate exploit generation and verification in DeFi smart contracts.
Findings
Achieves 98% recall and 0.9 F1-score in vulnerability detection.
Reproduces 85 historical exploits, recovering over $116.2M.
Outperforms state-of-the-art fuzzers and exploit generators significantly.
Abstract
Smart contract vulnerabilities in Decentralized Finance caused over billions of dollars losses every year, yet the security community faces a critical bottleneck: identifying a vulnerability is not the same as proving it is exploitable. Manual PoC construction is prohibitively labor-intensive, leaving most disclosed vulnerabilities unverified and protocols exposed long before mitigation is applied. In this paper, we propose \sys, a knowledge-driven agentic system for end-to-end contract vulnerability detection and exploit synthesis. Our core insight is that exploit synthesis is not a code generation task but a \emph{structured reasoning problem} that requires grounded knowledge of protocol semantics, failure root cause, and exploit primitives. \sys organizes this knowledge into a \emph{Hierarchical Knowledge Graph} (HKG) that serves as structured memory for LLM-guided multi-hop…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
