ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2605.05559v1· 20 results

cs.CRcs.GTRecentApr 5, 2026

Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty

Sarisht Wadhwa, Aviv Yaish, Fan Zhang, Kartik Nayak

The paper analyzes transaction fee mechanisms in modern blockchains that use parallel execution and contingency, proving an inherent trade-off between minimizing risks for users and maximizing revenue…

View →
cs.GTcs.CRRecentMay 8, 2026

Game-Theoretic Analysis of Transaction Selection in DAG-Based Distributed Ledgers

Sebastian Müller, Alexandre Reiffers-Masson

The paper analyzes transaction selection strategies in DAG-based distributed ledgers using game theory, finding that Collaborative Fee Sharing (CFS) achieves superior performance compared to Random Fe…

View →
cs.CRRecentMay 28, 2026

Scarcity Is Not Enough: An Impossibility Result for Linear Sybil Cost Under Parallelizable Resources

Homayoun Maleki, Nekane Sainz, Jon Legarda, Igor Santos-Grueiro

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

View →
cs.GTcs.CRRecentApr 3, 2026

Trustless Provenance Trees: A Game-Theoretic Framework for Operator-Gated Blockchain Registries

Ian C. Moore

The paper proposes a trustless framework using dual-layer cryptographic commitments to solve the operator-gating problem in blockchain provenance trees, ensuring verifiable user attribution even when…

View →
cs.CRcs.DCcs.GTRecentMay 25, 2026

Proof of Useful Attestation: A Consensus Primitive for Attestation-Native Chains

Stefan Stefanović

The paper proposes Proof of Useful Attestation (PoUA), a consensus mechanism that weights validator vote power not just by staked capital, but also by a reputation score earned through performing vali…

View →
cs.CRcs.LGRecentMar 19, 2026

Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference

Pranay Anchuri, Matteo Campanelli, Paul Cesaretti, Rosario Gennaro +3 more

The paper introduces a lightweight, sampling-based cryptographic protocol for verifiable AI inference that drastically reduces proving overhead from minutes to milliseconds by leveraging statistical p…

View →
cs.CRcs.CERecentMay 29, 2026

Free-Riding in the AI Economy: Demystifying Logic Flaws in x402-Enabled Payment Systems

Shengchen Ling, Yihang Huang, Yuan Chen, Yajin Zhou +2 more

This paper analyzes the x402 payment protocol, revealing systemic vulnerabilities in state synchronization and signature design that allow attackers to exploit payment systems for resource leakage in…

View →
cs.CRcs.CERecentMay 29, 2026

Free-Riding in the AI Economy: Demystifying Logic Flaws in x402-Enabled Payment Systems

Shengchen Ling, Yihang Huang, Yuan Chen, Yajin Zhou +2 more

This paper analyzes the x402 payment protocol, revealing critical synchronization and security flaws that allow attackers to exploit payment systems and force merchants to subsidize compute costs.

View →
cs.CRRecentApr 29, 2026

Catching the Fly: Practical Challenges in Making Blockchain FlyClient Real

Pericle Perazzo, Dario Capecchi

This paper advances the lightweight blockchain verification protocol, FlyClient, by addressing technical challenges, introducing a new adversary model, and providing practical implementations and opti…

View →
cs.AIcs.CLcs.CRRecentApr 18, 2026

The Cognitive Penalty: Ablating System 1 and System 2 Reasoning in Edge-Native SLMs for Decentralized Consensus

Syed Muhammad Aqdas Rizvi

The paper demonstrates that for edge-native SLMs used in decentralized governance, simpler, intuitive reasoning (System 1) is significantly more robust and efficient than complex, iterative deliberati…

View →
cs.CRcs.SERecentJun 3, 2026

A formal framework for the economic security of DeFi compositions

Massimo Bartoletti, Riccado Marchesin, Roberto Zunino

The paper introduces MEV non-interference, a formal security notion, to ensure that composing new smart contracts in DeFi does not increase the maximal extractable value, thereby providing a formal fo…

View →
cs.CRcs.GTRecentApr 6, 2026

Economic Security of VDF-Based Randomness Beacons: Models, Thresholds, and Design Guidelines

Zhenhang Shang, Kani Chen

This paper develops a formal economic framework to assess the security of VDF-based randomness beacons, demonstrating that many proposed delays are economically insecure due to rational, profit-motiva…

View →
cs.CRcs.DCcs.GTRecentJun 3, 2026

Bitcoin After Block Rewards

Junhyuk Lee

This paper analyzes the conditions under which Bitcoin's security might fail due to miners deviating from honest mining when block rewards decline to zero, concluding that protocol mechanisms can miti…

View →
cs.DCcs.CRcs.GTRecentApr 21, 2026

Intercloud: Eventual Consistency for Decentralised Economies via Chilling-Effect Consensus

Gregory Magarshak

Intercloud proposes a decentralized economic network that achieves eventual consistency and security using a novel 'chilling-effect consensus' mechanism, eliminating the need for global coordination.

View →
cs.CRcs.SERecentApr 28, 2026

GenDetect: Generalizing Reactive Detection for Resilience Against Imitative DeFi Attack Cascade

Bowen Cai, Weiheng Bai, Youshui Lu, Haoran Xu +3 more

GenDetect introduces a novel framework to rapidly generalize detection rules from single observed DeFi exploits, significantly improving resilience against subsequent, similar 'Imitative Attack Cascad…

View →
cs.CRcs.DCRecentMar 24, 2026

AetherWeave: Sybil-Resistant Robust Peer Discovery with Stake

Kaya Alpturer, Constantine Doumanidis, Aviv Zohar

AetherWeave is a novel, stake-backed peer-discovery protocol that achieves Sybil resistance and privacy in P2P networks, ensuring robust connectivity even against powerful adversaries.

View →
cs.AIcs.CRRecentMar 26, 2026

On the Foundations of Trustworthy Artificial Intelligence

TJ Dunham

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

View →
cs.GTcs.CRRecentMay 26, 2026

A Trilemma in AMM Mechanism Design

Yuhao Li, Elaine Shi, Mengqian Zhang

The paper analyzes the trade-offs in designing Automated Market Makers (AMMs) and proves a 'trilemma' theorem showing that it is impossible to simultaneously achieve incentive compatibility (IC), weak…

View →
cs.CRRecentMay 9, 2026

Toward Web 4.0: Bidirectional Trust between AI Agents and Blockchain

Yunfeng Xia, Chao Li, Lei Li, Chenhao Zhang +3 more

The paper systematizes the interaction between autonomous AI agents and blockchain platforms using a bidirectional trust framework, identifying significant gaps in current standards and proposing a ta…

View →
cs.CRRecentApr 4, 2026

LiquiLM: Bridging the Semantic Gap in Liquidity Flaw Audit via DCN and LLMs

Zekai Liu, Xiaoqi Li, Wenkai Li, Zongwei Li

LiquiLM is a novel framework that combines Large Language Models (LLMs) with a Dynamic Co-Attention Network (DCN) to effectively bridge the semantic gap between complex smart contract code and high-le…

View →