Table of Contents
Fetching ...

Proof of Response

Illia Polosukhin, Alex Skidanov

TL;DR

Proof of Response addresses the challenge of verifiable responsiveness in decentralized networks by providing a per-request primitive that yields either a signed response or a blockchain-verifiable proof of non-response. It leverages per-edge state channels and a governance-enabled penalty model on NEAR to incentivize reliable service while allowing continued operation through alternative routes. Key contributions include the formalization of the path-based protocol, the edge-severance and late-payment mechanisms, and practical considerations like bandwidth management and stake-weighted centrality. This approach enables applications such as decentralized storage and autonomous agents with provable uptime, potentially reducing downtime costs and increasing reliability in open networks.

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.

Proof of Response

TL;DR

Proof of Response addresses the challenge of verifiable responsiveness in decentralized networks by providing a per-request primitive that yields either a signed response or a blockchain-verifiable proof of non-response. It leverages per-edge state channels and a governance-enabled penalty model on NEAR to incentivize reliable service while allowing continued operation through alternative routes. Key contributions include the formalization of the path-based protocol, the edge-severance and late-payment mechanisms, and practical considerations like bandwidth management and stake-weighted centrality. This approach enables applications such as decentralized storage and autonomous agents with provable uptime, potentially reducing downtime costs and increasing reliability in open networks.

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.

Paper Structure

This paper contains 15 sections, 2 equations.