Skip to content
Crypto.world

Research

Prrr: Personal Random Rewards for Blockchain Reporting

Smart contracts frequently need a piece of external information — a report — to trigger their logic, and they pay cryptocurrency to whoever publishes it on chain.

Prrr: Personal Random Rewards for Blockchain Reporting
arXiv
2511.12626
Published
2025-11-16
Authors
Hongyin Chen, Yubin Ke, Xiaotie Deng, Ittay Eyal

AI summary

Overview

Research area: Blockchain security and algorithmic game theory — specifically incentive/mechanism design for the problem of getting external data ("reports") onto a blockchain in a timely, decentralized, and low-cost way (arXiv category cs.CR; published at the 2026 IEEE Symposium on Security and Privacy).

Technical level: Advanced. The paper is built on formal mechanism design, Stackelberg game modeling, backward induction, and Subgame-Perfect Nash Equilibrium analysis; the introduction and the intuition behind Theorem 1 are accessible, but the proofs and the protocol definition assume comfort with game-theoretic notation.

Scope (one sentence): The paper diagnoses why existing on-chain reporting incentives force a security-versus-efficiency trade-off, proves that no symmetric-reward mechanism can escape it, and proposes and analyzes Prrr, a protocol that assigns random heterogeneous values to reports to achieve incentive compatibility together with security and efficiency.

What This Paper Is About

Smart contracts frequently need a piece of external information — a report — to trigger their logic, and they pay cryptocurrency to whoever publishes it on chain. Paying a small trusted set of publishers concentrates power and creates a single point of failure; letting anyone publish triggers races that either destroy publisher profit or flood the chain with redundant reports. The paper proves that the standard practice of rewarding all reports symmetrically is the root cause of this dilemma, and it designs a protocol (Prrr) that deliberately makes reports unequal, ex ante, through randomness.

Key Contributions

  1. A formal model of the blockchain reporting problem. The authors model publishers (who generate reports at a fixed per-report cost and can rate-limit themselves via PoW or PoS), validators (who choose which reports to include in blocks and can receive bribes), epochs of T blocks, a random beacon pulse Q^k and validator-derived random string S^k, and four desired properties: decentralization, fairness, C-efficiency (at most a constant C reports included per epoch), and progress (at least one report included at the first step).

  2. An impossibility theorem for symmetric designs. Theorem 1 states that for any protocol with symmetric rewards and symmetric bribery, if it satisfies incentive compatibility, efficiency for any C, and progress, then whenever the total number of generated reports exceeds C, all publishers have zero expected revenue — violating decentralization.

  3. A new mechanism-design concept and protocol. Ex-Ante Synthetic Asymmetry (EASA), which the authors describe as the first game-theoretic mechanism in any context that deliberately forms participant asymmetry, instantiated as Prrr: a second-price-style settlement in which the validator includes the reports with the highest and second-highest random values, is paid an amount equal to the second-highest value, and the publisher of the highest-value report is paid the difference between its value and the second-highest value. Two random-value functions satisfying the requirements are provided.

  4. A game-theoretic security analysis. Using backward induction on the sequential publisher/validator game, the authors show that following Prrr is a Subgame-Perfect Nash Equilibrium and characterize its robustness to collusion, Sybil attacks, and deviation.

Main Findings

  • The trade-off and its root cause. Small trusted publisher sets introduce centralization and single-point-of-failure risk, with real outages reported in rollups; open submission causes intense competition, eroded participation incentives, or excessive on-chain reports even in protocols that reward only one report, as observed in liquidation events. The authors identify symmetric reward design — treating all reports as interchangeable — as the root cause.

  • Symmetry makes the problem unsolvable. Theorem 1 shows that under symmetric rewards and symmetric bribery, incentive compatibility plus efficiency plus progress forces every publisher to zero expected revenue once more than C reports exist. The proof has an excluded publisher bribe the validator with the sum of both publishers' original bribes plus one third of the included publisher's revenue, making the swap the validator's unique best response and the deviation strictly profitable.

  • The Prrr allocation rule. Publishers are required to publish all reports without bribing validators; the validator includes the two reports with the highest random values. The contract pays the validator the second-highest value and pays the top publisher the gap between the highest and second-highest values. This requires security to rest on a careful choice of random-value function, which must make publisher rewards monotonic in the number of published reports and must keep validators including transactions even under bribery; two such functions are given.

  • Equilibrium and robustness. Following the protocol is a Subgame-Perfect Nash Equilibrium. Publisher–publisher collusion and Sybil attacks are not beneficial; collusion between publishers and the current step's validator does not raise the colluding parties' utility; any validator deviation strictly reduces the validator's own utility under one of the two random-value functions; and when a publisher's deviation harms other publishers' revenue, the deviating publisher's own revenue strictly decreases.

  • Practical scale of the problem. On Ethereum there are over 1,000 daily reports, whose costs reach approximately 14 times the median transaction cost in their respective blocks (the derivation is in Appendix A, which is not included in the supplied content).

  • Positioning against prior work. Existing approaches include paying a fixed bounty to the first valid report, ZkFair (which rewards multiple publishers of the same claim but sacrifices efficiency because every report is recorded on chain), Chainlink's watchdog-priority scheme for price-bias alerts, and the alerting problem formalized by Mouallem et al. — the latter two assume a predefined set of staked publishers, whereas Prrr allows public participation. Fair transaction ordering does not resolve the trade-off, because a publisher with better connectivity or computing power can consistently win.

  • Not reported in the supplied content. The excerpt is truncated before the later sections and appendices. It reports no quantitative evaluation of Prrr itself — no gas measurements, reward magnitudes, parameter choices, or deployment results — and the application examples in Appendix B are referenced but not included.

Methodology in Plain English

The authors start by writing down a clean model: publishers who pay a fixed cost per report and can send transactions with fee bids and bribes; validators who pick which transactions to put in a block; and a smart contract that pays out according to a rule. They then state precisely what a good protocol must achieve — capped on-chain volume, positive revenue for participants, rewards proportional to effort, and fast inclusion.

Next they isolate the assumption they believe is at fault: that any two valid reports are interchangeable. Formalizing this as symmetric reward and symmetric bribery, they show through a constructive deviation argument that symmetry plus the other requirements collapses publisher revenue to zero. The construction is intuitive: if some publisher is left out while another earns, the excluded publisher can pay the validator slightly more than the incumbent arrangement is worth and take the slot, so no symmetric equilibrium can leave anyone with a positive payoff.

To escape the impossibility, the protocol must break symmetry — so Prrr assigns each report a value drawn from randomness that is fixed before participants act (a public beacon pulse, from which the validator derives a random string). Settlement is second-price-like: the runner-up's value determines the validator's payment, and the winner keeps only the margin. This makes publishing more reports raise a publisher's chance of holding the top value, while the validator's payoff depends on the second-highest competing value, so both sides prefer the prescribed behavior over bribery or censorship. The authors then model each step as a two-phase sequential game and use backward induction to check that the prescribed strategy profile is a Subgame-Perfect Nash Equilibrium, and they probe it with collusion, Sybil, and deviation scenarios.

Why This Matters

The paper contributes an impossibility result that explains a widely observed practical failure, and a new mechanism-design primitive — deliberately introducing ex-ante asymmetry among participants — that the authors claim has no precedent in game theory. For research, it reframes the reporting problem as a reward-design problem rather than an ordering or reputation problem, and it gives a template (EASA) that may transfer beyond blockchains.

Real-world applications the paper points to:

  • Rollups, where reporting failures have caused real outages and where report generation and publication are central to operation.
  • Cross-chain protocols, which depend on timely reports of state from other chains.
  • Misbehavior reporting and watchtowers, where an alert about a protocol violation must land on chain within a bounded window.
  • Financial event triggers such as liquidations, where the current race dynamic produces congestion and elevated fees.

Industry relevance is direct: the measurement cited (over 1,000 daily reports on Ethereum, costing around 14 times the median transaction cost in their blocks) indicates that report inclusion is already a meaningful cost and congestion source, and bribe channels such as Flashbots already exist to monetize inclusion priority. The protocol targets the teams maintaining rollups, bridges, and DeFi contracts who currently choose between a trusted reporter and an open race.

Future Directions

  • Random-value function design. The paper supplies two functions and notes that strict punishment of validator deviation holds for one of them; a broader characterization of which functions give the desired monotonicity and bribe-resistance properties is a natural next question.
  • Deployment and measurement. The supplied content reports no evaluation of Prrr on a live chain; gas overhead, parameter selection, and behavior under real bribery infrastructure such as Flashbots remain to be measured.
  • Scope extensions. The analysis focuses on a single epoch and on functionally equivalent reports; extending it to repeated epochs, multiple concurrent epochs, and to settings with a predefined staked publisher set (as in the alerting problem and Chainlink's watchdog scheme) are open directions.
  • Generalizing Ex-Ante Synthetic Asymmetry. Since EASA is presented as a general concept, applying deliberate ex-ante asymmetry to other competition-for-inclusion or first-responder problems beyond blockchain reporting is the obvious follow-on.

Target Audience

This paper is most valuable to blockchain security and protocol researchers, to economists and computer scientists working in mechanism design and algorithmic game theory, and to engineers designing incentive layers for rollups, bridges, oracle-adjacent systems, and DeFi contracts. Readers wanting only the intuition can take away the introduction and Theorem 1; readers wanting to implement Prrr will need the full protocol specification, the random-value functions, and the equilibrium proofs, which lie beyond the truncated content summarized here.

Authors’ abstract

Smart contracts, the stateful programs running on blockchains, often rely on reports. Publishers are paid to publish these reports on the blockchain. Designing protocols that incentivize timely reporting is the prevalent reporting problem. But existing solutions face a security-performance trade-off: Relying on a small set of trusted publishers introduces centralization risks, while allowing open publication results in an excessive number of reports on the blockchain. We…

The full abstract on arXiv
Read the original paper