Multi-Hop Payment

A Multi-Hop Payment is a routing technique in a payment channel network, such as the Lightning Network, that allows a payer to send funds to a recipient through a path of intermediate nodes, even when the two parties do not share a direct, open channel. This is achieved by constructing an HTLC (Hashed Timelock Contract), a conditional payment that locks funds at each hop with a cryptographic secret, enabling trustless forwarding. The process is analogous to packet routing on the internet, where data finds a path through multiple routers to reach its destination.

The core cryptographic primitive enabling this is the hashlock and timelock. The payer generates a secret preimage and shares its hash within the HTLC. Each intermediary node in the path agrees to forward the payment, locking their funds with the same hash condition. Only when the final recipient reveals the secret to claim the payment does it propagate backwards, allowing each intermediary to sequentially claim the funds from the previous hop. Timelocks ensure that if the payment fails, all locked funds are automatically refunded, preventing capital from being stuck indefinitely.

This architecture is fundamental to achieving scalability and fungibility in layer-2 networks. It eliminates the need for a complete mesh network where every user must have a direct channel with every other user, which would be capital-intensive and impractical. Instead, liquidity can be concentrated in well-connected routing nodes, creating efficient payment corridors. Key challenges include liquidity balancing across channels, privacy considerations as intermediaries see payment amounts, and the economic incentives for nodes to provide routing services for a fee.

A multi-hop payment is a cryptographic transaction that is routed through a series of intermediate nodes, or hops, to connect a sender and receiver who do not share a direct payment channel. This process is fundamental to Layer 2 scaling solutions like the Lightning Network for Bitcoin and similar state channel networks, enabling fast, low-cost, and private transfers. It solves the critical problem of network liquidity by utilizing the interconnected web of existing channels without requiring every user to be directly connected.

The mechanism relies on Hash Time-Locked Contracts (HTLCs), which create a conditional payment path. The sender generates a cryptographic secret and its hash, then constructs a route where each hop forwards the HTLC, locking funds with the hash. Only when the final recipient reveals the secret to claim the payment can each preceding hop sequentially claim their funds back from the next node in the chain. This use of atomicity ensures the entire payment either succeeds completely or fails, with all funds returned, preventing loss during routing.

Key advantages of this architecture include enhanced privacy, as intermediaries only see their immediate predecessor and successor, not the full path, and improved capital efficiency by leveraging the network's aggregate liquidity. Operational challenges involve pathfinding algorithms to discover efficient routes and managing channel balance to avoid failed payments due to insufficient local liquidity. This design is a cornerstone of scalable, user-friendly blockchain payments, abstracting away the underlying complexity of the channel graph.