🤖 AI Summary
This paper addresses the lack of verifiable timeliness guarantees for cross-node data requests in decentralized networks. To resolve this, we propose a response assurance mechanism that jointly ensures timeliness, cryptographic verifiability, and economic incentives. Methodologically, we design an timeout-triggered protocol, a lightweight path-state proof scheme, and an on-chain streaming-payment smart contract—ensuring the requester (Alice) receives either the requested data, cryptographically verifiable evidence of link failure, or proportional compensation scaled by timeout duration, all within a pre-specified deadline *b*. Our key contribution is the first deterministic response commitment paradigm for trustless environments. Experiments on real-world P2P networks demonstrate millisecond-scale verification latency for response commitments, failure detection latency under 50 ms, and payment settlement within fewer than two blockchain blocks—enabling latency-sensitive decentralized applications such as distributed storage systems and AI agent orchestration.
📝 Abstract
We present a mechanism that for a network of participants allows one participant of the network (Alice) to request some data from another participant (Bob) and either receive a response from Bob within a known-in-advance, bounded time b, or receive a proof that at least one edge on the way to Bob was broken within b, or receive a streaming payment proportional to time passed beyond b during which neither was received. This mechanism allows for building downstream applications that require provable responses from other participants, such as decentralized storage solutions, decentralized AI agents, and more.