Author: Rusty Russell 2016-09-06 00:49:24
Published on: 2016-09-06T00:49:24+00:00
In a discussion about how a payee instructs a payer on how to make a payment, Joseph brought up a critical issue. Rusty then presented his wishlist, which includes the following points: minimal state required on the client and server, minimal network queries by the client, and presentation of a standard QR code for one-way communications. Rusty then discussed three possibilities that could address this issue. The first possibility is to present only the amount and public node address, relying on the routing protocol for the client to reach its destination. This option requires only 4+33 bytes. However, the client must know either the entire network or query for route and fee information, which could result in privacy leaks.The second possibility involves presenting one or more chains of channels from landmarks, with fee information represented as blocknum and txnum pairs. This option adds 4+4+2 bytes per hop and requires the client to know the channel tx->node ID mapping for all nodes. The client must also know routes to landmarks or query for them.The third possibility is similar to the second, but it includes IDs for each hop in the chain. This option adds an additional 33 bytes per hop and requires the client to know routes to landmarks or query for them. Rusty notes that option C is more scalable, while option B would work for the first million or so nodes.
Updated on: 2023-05-24T00:24:41.093189+00:00