Skip to content
Conference

PRECISE: Precision-Driven Discovery of Token-centric MEV

Aug 2026 · International Conference on Multimedia Analysis and Pattern Recognition · pp. 382-387 · 0 citations · 28 references

Abstract

Token-centric maximal extractable value (tMEV) arises when token supply-control behavior interacts with exchanges whose pricing ignores particular balance updates. Existing analyses face state explosion, missing deep inter-transaction paths or producing false positives. PRECISE combines token-level static filtering, fork-based dynamic fuzzing, and state-difference verification. Inter-procedural system dependence graphs (SDGs) identify candidate paths from source or bytecode; utility-guided fuzzing validates them on a pinned Anvil mainnet fork against authorization-, event-, and profitability-aware Type-1/Type-2 predicates. This division limits dynamic search to supply-sensitive control flow while retaining execution-grounded validation. Profitability follows a constant-product automated market maker (AMM) slippage model. PRECISE scans 22,279 token contracts and 7,030 pools; on the 499-contract standard scored set it reaches 72.45% precision, 84.58% recall, and 78.04% F1 against Nyx, FORAY, DeFiTainter, and SmartCAT. Recall rises to 91.2% on a 150-contract Complex-Tokens stress set. The artifact pins replay contexts and reproduces the scan for an estimated compute cost of $25.84 at the reported instance-hour rate.

View source

Similar papers

Preprint Aug 2026

Memory-Sovereign Inference: Output-Exact Execution Beyond Full Residency

A falsifiable certificate is presented separating representation, semantic demand, scheduler requests, and traffic while naming resource authorities, exactness horizons, and tested reuse transitions while naming resource authorities, exactness horizons, and tested reuse transitions.

L. Štěpánek · 0 citations
Preprint Sep 2026

CPUNeSy: Controlling Model Writes for Reliable Neuro-Symbolic Reasoning

LLMs excel at recalling statistical patterns but degrade sharply when answers must be derived, especially on multi-hop chains. Delegating derivation to deterministic symbolic executors shifts reliability to whether model-generated premises are source-supported. We introduce CPUNeSy, a serving architecture that controls...

Zeyan Li, Si-Yuan Qiu, Shuai Zhao et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Stale Does Not Mean Unsafe: Guard Precision for Tool-Using LLM Agents under Infrastructure State Races

This work evaluates three commit-time guard granularities (global epoch, read-set version, semantic commit predicate), multi-level verification, and model-side gates on three locally hosted quantized model families, and investigates how precisely runtime guards distinguish invalidating races.

Zi-Hao Zheng, Jia-Yu Long, Bai-Chuan Li et al. · 0 citations
Open access Oct 2026

ReFun: Reconstructing Function Boundaries in EVM Bytecode

Recovering the structure of a Solidity smart contract from its deployed bytecode is a prerequisite for various downstream analyses, such as control-flow graph construction, decompilation, and clone detection. A central step in this task is identifying private functions. However, since all source-level function boundari...

Yi-Chuan Li, Wei Song, Jeff Huang et al. · 0 citations
Conference Open access Sep 2026

QiMeng-VPID: Verification-Grounded Port-Level Iterative Decomposition for Complex Verilog Generation

This work proposes VPID, a multi-agent framework for generating complex Verilog that achieves monotonic functional improvement and introduces an experience-guided refinement strategy that distills historical waveform mismatches into constraints, guiding the targeted debugging for the unverified ports.

Hong-Guang Wang, Jiaming Guo, Rui Zhang et al. · 0 citations
Sep 2026

InterFuse: Scalable Detection of Memory Safety Violations via Differential Reasoning and Hierarchical Context Fusion

This work proposes InterFuse, a framework for differential path reasoning that builds compact interprocedural control-flow graphs with targeted pruning, samples high-contrast paths via genetic optimization, and uses hierarchical fusion with a lightweight concatenation-based module to enhance discriminative signals.

Yao Zhang, Rui-Jie Cai, Xiao-Kang Yin et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.