DOCSEARCHbyAlgolia
Submit Docs

HOPR Network Documentation

website·Indexed 35 days ago

https://docs.hoprnet.org

Technical documentation for the HOPR network, focusing on the HOPRd node. Includes guides for installation via Docker, macOS, and Dappnode; node operations, identity backup and restoration, and configuration strategies for v3.0.0. Also covers core concepts such as anonymous routing, cover traffic, and token wrapping on the Gnosis Chain.

Tokens
51.8K
Snippets
157
Records
437
Agent score
59%

What's inside HOPR

  1. Overview of the HOPR Privacy Network

    v2.2.3
    HOPR is a decentralized, transparent, and trustless platform that enables people, companies, and devices to exchange information online with complete privacy. Unlike standard encrypted communications where metadata (who is sending data, when, and to whom) remains exposed, HOPR obscures this metadata so that no third party can determine what data is being shared, the identities of the sender and receiver, or the volume of data being transmitted.

  2. Overview of the HOPR Network

    HOPR is a decentralized, incentivized network for private data transfer that ensures complete privacy by preventing metadata tracking.

  3. Overview of HOPRd Fast Sync

    Fast Sync (introduced in HOPRd v2.2.0) accelerates node synchronization by using HOPR logs database files. This allows a node to read on-chain data more efficiently, reducing synchronization time to approximately 10-20 minutes, even without a local RPC provider. There are two implementation methods: Automatic Fast Sync (uses database files provided by HOPR) and Manual Fast Sync (uses your own pre-synced database files).

  4. Overview of HOPRd Fast Sync

    v2.2.3
    Introduced in HOPRd version 2.2.0, Fast Sync speeds up node synchronization by utilizing HOPR logs database files. These files contain logs from a previous sync performed via an RPC provider, allowing a node to read on-chain data more efficiently. This process can reduce synchronization time to approximately 10 to 20 minutes, depending on hardware, even without a local RPC provider.

  5. Overview of the HOPR Network

    v2.2.3
    HOPR is a decentralized, incentivized network designed for private data transfer. It ensures complete privacy by preventing metadata tracking.

  6. Overview of HOPR Fast Sync

    Fast Sync (introduced in HOPRd v2.2.0) accelerates node synchronization by using HOPR logs database files to read on-chain data efficiently. This reduces synchronization time to approximately 10-20 minutes, even without a local RPC provider. There are two implementation methods:

    1. Manual Fast Sync: Uses your own pre-synced database files. Requires that the node has been fully synchronized at least once previously.
    2. Automatic Fast Sync: Uses pre-synced database files provided by HOPR, which are downloaded automatically. Users must trust the integrity of the files provided by HOPR when using this method.

  7. Overview of the HOPR privacy network

    HOPR is a decentralized, transparent, and trustless platform that allows people, companies, and devices to exchange information online with complete privacy. Unlike standard encrypted communication where metadata (who is sending data, when, and to whom) remains exposed, HOPR ensures that no external party can determine what data is being shared, the identities of the sender and receiver, or the volume of data being transmitted.

  8. Overview of HOPR Fast Sync

    Fast Sync (introduced in HOPRd v2.2.0) accelerates node synchronization by using HOPR logs database files. This allows nodes to read on-chain data more efficiently, reducing synchronization time to approximately 10-20 minutes, even without a local RPC provider.

    There are two implementation methods:

    1. Manual Fast Sync: Uses your own pre-synced database files from a previously fully synchronized node.
    2. Automatic Fast Sync: Uses pre-synced database files provided by HOPR (requires trusting the integrity of HOPR-provided files).

  9. Overview of HOPRd Fast Sync

    Fast Sync (introduced in HOPRd v2.2.0) accelerates node synchronization by using HOPR logs database files to read on-chain data more efficiently. This reduces synchronization time to approximately 10-20 minutes, even without a local RPC provider.

    There are two implementation methods:

    1. Automatic Fast Sync: Uses pre-synced database files provided by HOPR (requires trusting the integrity of HOPR-provided files).
    2. Manual Fast Sync: Uses your own pre-synced database files from a previously fully synchronized node.

  10. Overview of HOPRd Fast Sync

    Fast Sync (introduced in HOPRd v2.2.0) accelerates node synchronization by using HOPR logs database files to read on-chain data more efficiently. This can reduce synchronization time to 10-20 minutes, depending on hardware, even without a local RPC provider. There are two implementation methods:

    1. Manual Fast Sync: Uses your own pre-synced database files from a node you have previously fully synchronized.
    2. Automatic Fast Sync: Uses pre-synced database files provided by HOPR (requires trusting the integrity of HOPR-provided files).

  11. Understand HOPR Probabilistic Payments

    v2.2.3

    HOPR uses probabilistic payments to decouple the relaying of data packets from blockchain transactions. Instead of every relayed packet generating a guaranteed reward (which would cause high gas costs and leak metadata), HOPR issues cryptographic tickets that act like lottery tickets.

    In this system, most tickets are worthless, but a small percentage can be redeemed for a larger reward. This ensures that the expected value of the rewards remains the same while significantly reducing the number of on-chain transactions and the associated gas fees. Because node runners process millions of packets daily, the actual rewards converge toward the expected value, minimizing volatility.

  12. Implement trustless node incentives using Proof of Relay

    HOPR uses a mechanism called 'Proof of Relay' to ensure nodes are rewarded only after they have successfully relayed data. This prevents nodes from claiming incentives without performing work, which is a risk in anonymous mixnets where route failures are difficult to track.

    The mechanism works by splitting the cryptographic keys required to claim a payment into two halves. A node can only claim its payment once it possesses both halves of its key. To achieve this, consecutive pairs of nodes in a relay chain must swap key halves: a node swaps a portion of its own key for a portion of the previous node's key. This creates a mutual dependency where neither node can be paid unless the data is successfully passed to the next hop, aligning selfish incentives with the correct operation of the network.