HOPR

• Name: HOPR
• URL: https://hoprnet.org/
• Category: incentivized mixnet / privacy-preserving messaging transport / proof-of-relay payment infrastructure
• Summary: HOPR is a mixnet with relay economics bolted on hard enough to matter. The useful piece is proof of relay plus tickets and probabilistic payouts: paying node operators without fully collapsing metadata privacy.
• What it does:
  • Provides a decentralized relay network where packets move through a mixnet so outside observers have a harder time linking sender, receiver, timing, and packet size
  • Uses Sphinx packet formatting and mixing so packets become indistinguishable and can be recombined across multiple relay cycles
  • Introduces proof of relay, where adjacent nodes depend on each other to unlock payment, aligning incentives so forwarding data is the profitable behavior
  • Uses tickets, payment channels, and probabilistic payments to reduce the direct link between each relay event and onchain reward settlement
  • Incorporates cover traffic so the network can maintain a minimum privacy floor even when organic traffic is thin
  • Ships a production node stack (hoprd, hopr-lib, and related tooling) plus developer-facing documentation for integrating HOPR as a transport layer
• Key claims:
  • HOPR’s docs frame the project around metadata privacy, stressing that ordinary internet encryption leaves visible who talked to whom, when, and how much data moved
  • The mixnet docs make clear that indistinguishable packets alone are not enough; privacy depends on many users sharing the network and on deliberate mixing delays, which means HOPR belongs in the corpus as transport/privacy infrastructure rather than as a generic app protocol
  • Proof of relay is the central mechanism worth retaining: HOPR says each consecutive pair of nodes in a relay chain becomes interdependent for payment, so payment is unlocked only when forwarding actually happens
  • The tickets and payment-channel docs show the second important design move: reward settlement is delayed and aggregated so public-chain activity does not map one-to-one onto each relay event
  • The cover-traffic docs show that privacy is partially policy- and incentive-dependent, not purely cryptographic; HOPR explicitly ties background traffic and staking to the network’s minimum anonymity set
  • HOPR is a useful comparison class for Nym and Waku because it lives in the same broad privacy / coordination space but puts much more weight on cryptoeconomic relay incentives and onchain reward plumbing than Waku’s modular messaging stack does
• Whitepaper: Yes. HOPR publishes The Book of HOPR, which serves as the clearest official whitepaper-style overview for this pass, alongside the live docs and monorepo README; see ../whitepapers/hopr-primary-sources-2026-05-09.md. Local paper copy: ../whitepapers/hopr-book-of-hopr-2021.pdf.
• Sources:
  • https://hoprnet.org/
  • https://docs.hoprnet.org/
  • https://docs.hoprnet.org/core/what-is-hopr
  • https://docs.hoprnet.org/core/mixnets
  • https://docs.hoprnet.org/core/proof-of-relay
  • https://docs.hoprnet.org/core/tickets-and-payment-channels
  • https://docs.hoprnet.org/core/cover-traffic
  • https://github.com/hoprnet/hoprnet
  • https://raw.githubusercontent.com/hoprnet/hoprnet/master/README.md
  • https://hoprnet.org/Book_Of_Hopr_2021.01_v1.pdf

Internal linkages

• Keep this note on nym, waku, and xmtp.

Control surface

• The leverage sits in relay topology, cover-traffic policy, ticket economics, payment-channel plumbing, and the incentive parameters that decide whether nodes actually forward traffic.

• Keep the note on proof-of-relay economics and metadata protection, not on generic private messaging haze.

• Last reviewed: 2026-06-11 UTC